Extended kalman filter for autonomous satellite navigation system

ABSTRACT

An autonomous navigation system for an orbital platform incorporating a global positioning system based navigation device optimized for low-Earth orbit and medium-Earth orbit applications including a 12 channel, GPS tracking application-specific integrated circuit ( 15 ) operating in concert with a computer system ( 90 ) implementing an extended Kalman filter and orbit propagator which autonomously generates estimates of position, velocity and time to enable planning, prediction and execution of event-based commanding of mission operations.

CROSS-REFERENCE TO RELATED APPLICATION

[0001] This application claims the benefit of prior filed copending U.S. application Ser. No. 09/295,544, filed Apr. 21, 1999.

STATEMENT OF GOVERNMENTAL INTEREST

[0002] The Government has rights in this invention pursuant to Contract No. NAS5-97271 awarded by the National Aeronautics and Space Administration.

BACKGROUND OF THE INVENTION

[0003] 1. Field of the Invention

[0004] This invention relates to global positioning system based navigation techniques for developing position and velocity data required for autonomous operation of satellites incorporating on-board, event-based command systems.

[0005] 2. Discussion of the Related Art

[0006] Spacecraft tracking and navigation began when The Johns Hopkins University Applied Physics Laboratory determined Sputnik's orbital parameters as a function of the doppler shift of an on-board radio beacon. That was in 1957. Soon thereafter, that organization devised and developed the Navy Transit Satellite Navigation System which provided global navigation services for the military and civilian community for over 35 years. The “TRANSIT” system used a network of low earth orbit satellites and therefore it was unacceptable for most spacecraft navigation applications.

[0007] A limited number of experimental systems developed by the Applied Physics Laboratory (APL), NASA and the U.S. Air Force provided semi-autonomous means for orbit determination and prediction. The experimental system provided ground-based orbit determination for spacecraft through the use of complex ground stations and coherent transponders that reside on the spacecraft to be tracked. The French National Space Agency has operated a similar system, DORIS, since the early 1990s. However, the high cost of operating such systems has forced spacecraft operators to find other tracking methods.

[0008] Over the last three decades, APL and other organizations have demonstrated the feasibility of using GPS for positioning satellites and other high dynamic platforms. For over 20 years, the APL developed SATRACK system has utilized GPS translators and ground-based signal processing systems for trajectory reconstruction and guidance system evaluation of Navy Trident missiles. The first GPS-based navigation of a satellite occurred on Transat, an APL spacecraft launched in 1978 and operated for over 10 years. Transat was a Transit navigation satellite with an on-board GPS translator.

[0009] Autonomous positioning of satellites using space borne GPS receivers was first demonstrated in the early 1980s when APL developed and flew four GPSPAC systems, and in the early to mid 1990s when NASA and the Jet Propulsion Laboratory used GPS receivers on the TOPEX/Poseidon spacecraft. More recently, other programs have adopted the use of GPS-based navigation systems for spacecraft. For instance, U.S. Pat. No. 5,109,346 for “Autonomous Spacecraft Navigation System” issued to J. Wertz on Apr. 28, 1992 describes a system using onboard observations of the earth, sun and moon to determine spacecraft attitude, instantaneous position and orbit based on multiple position estimates. Position and orbit data are derived by multiple deterministic solutions, including some that employ star sensors and gyros, and the multiple solutions are accumulated in a Kalman filter to provide continuous estimates of position and orbit for use when the sun or moon is not visible.

[0010] Developing totally autonomous satellites results in large cost savings because of the elimination of ground support stations. In addition, ground supported satellites are subject to ongoing maintenance costs and are prone to serious malfunction if ground support stations are damaged or if control signal transmissions are interfered with.

OBJECTIVES OF THE INVENTION

[0011] A primary objective of the present invention is to provide a satellite for collecting data which utilizes on-board event-based command techniques relying on a navigation system which uses an extended Kalman filter to process data derived from a plurality of global positioning satellites.

[0012] A further objective of the present invention is to provide an orbital platform for collecting data which utilizes an autonomous navigation system incorporating an application specific integrated circuit for processing signals from global positioning satellites in concert with an extended Kalman filter.

[0013] Another objective is to provide an autonomous, on-board, event-based command system responsive to a GPS based navigation system for controlling data collection functions on-board low-earth-orbit and medium-earth-orbit satellites.

[0014] A further objective of the invention is to provide an extended Kalman filter combined with an application specific integrated circuit for determining continuous real time earth-sun vector data, from a GPS constellation comprised of at least four satellites.

[0015] A still further objective is to provide an autonomous navigation system whose primary input data is derived from at least four satellites of a GPS constellation.

[0016] An objective of the invention is to provide an extended Kalman filter for interpreting data, from a GPS constellation comprised of at least four satellites and predicting ground contact event times therefrom.

[0017] Another objective is to provide an application specific integrated circuit for processing data required for tracking global positioning system satellites.

[0018] A further objective of the invention is to provide an extended Kalman filter combined with an application specific integrated circuit for interpreting data, from a GPS constellation comprised of at least four satellites, as continuous real-time orbital platform position and velocity.

[0019] A still further objective of the invention is to provide an extended Kalman filter combined with an application specific integrated circuit for propagating state vectors to allow estimating future orbital platform position from a GPS constellation comprised of at least four satellites.

SUMMARY OF THE INVENTION

[0020] The primary purpose of the present invention is to provide an autonomous navigation system for satellites to be employed in NASA's Solar Terrestrial Probe Program for measuring Thermosphere, Ionosphere, Mesosphere, Energetics, and Dynamics (TIMED). The TIMED program is a remote atmospheric remote sensing mission to study the interaction of the Sun and Earth's atmosphere. This spacecraft serves as an orbital platform for four instruments that measure the basic state parameters and energy balance of the mesospheric, lower thermospheic, and ionospheric regions, i.e. MLTI regions of the atmosphere. The program investigates and documents the energetics of the MLTI region, i.e., its pressure, temperature, density, and wind structure and the relative importance of various sources and sinks of energy. To make the required measurements, a 625-km circular orbit inclined 74.1 degrees with a nodal regression of 7200 per year is used. On-orbit instruments augmented by an array of ground-based instruments provide the basic measurements required by the mission. The instruments require precise knowledge of position and velocity of the orbital platform to perform their mission. This is accomplished by the autonomous navigation and time keeping system which provides position, velocity, time, and earth-sun vector data and notification of defined orbital events in real-time. It also generates predictions of events such as ground stations contacts. In addition, it generates orbital element sets which are down-linked for use by ground station antenna pointing systems. The navigation system contains two processors; a tracking processor which is responsible for controlling and interacting with GPS hardware in order to obtain raw tracking data and the navigation processor which is responsible for command and telemetry handling, determination of navigation solutions, generation of tracking acquisition aids and generation of the output data products. To simplify command control, the GPS based navigation system (GNS) is used to produce accurate estimates of position, velocity, and time to an event-based command system.

[0021] The GNS uses SPS ranging signals broadcast from the constellation of GPS satellites. The SPS ranging signal, referred to as L1 is Binary Phase Shift Key (BPSK) modulated. The modulation consists of two components that are modulo-2 summed: (1) a 1.023 MHz Pseudo-Random Noise (PRN) code known as the coarse acquisition (CA) code and (2), a 50 Hz navigation message. The CA code sequence repeats every 1 ms. The GNS receiver demodulates the received code from the L1 carrier, and detects the time offset between the received and a locally generated replica of the code. The receiver also reconstructs the navigation message data.

[0022] To compute TIMED spacecraft position, velocity, and time, the GNS determines the pseudorange to four or more GPS satellites in track. The propagation time to each GPS satellite is obtained by determining the difference between transmit and receipt times of the CA code. The pseudorange to each GPS satellite is computed by multiplying each propagation time measurement by the speed of light.

[0023] The navigation message transmitted from each GPS satellite provides data which are required to support the position determination process. That includes information to determine satellite time of transmission, satellite position, satellite health, satellite clock correction, time transferred to UTC, and constellation status.

[0024]FIG. 1 illustrates the 660 kg TIMED spacecraft which is three-axis stabilized and NADIR pointing. The majority of the bus electronics are contained in an integrated electronics module (IEM). The IEM is a highly integrated system with major spacecraft bus subsystems implemented on cards in a card cage to eliminate the more common self-contained modules or “black boxes”. The subsystems that populate the IEM are on cards which have common mechanical interfaces based on the Stretch SEM-E form-factor to simplify the design process. Two IBM processors are employed, configured as single-string redundant systems with a 1553 bus connecting the two.

[0025] A graphite epoxy optical bench is mounted on the spacecraft's zenith-facing surface to provide a thermally stable mounting surface for TIMED Doppler Interferometer (TIDI) telescopes and the attitude system's star trackers (required to satisfy TIDI attitude knowledge requirements). Two GPS Navigation System (GNS) antennas are mounted atop composite masts on the optical bench for performing on-orbit GPS attitude determination verification with a precision reference, or truth, data set.

[0026] The TIMED mission and spacecraft top-level command and control requirements are satisfied by the GNS which is designed specifically for TIMED and implemented on Application-Specific Integrated Circuits (ASIC). Although designed for TIMED, the GNS will satisfy the functional requirements that are typically placed on spaceborne autonomous navigation systems for LEO or MEO host vehicles.

[0027] The GNS includes redundant Standard Positioning Service (SPS) receiver systems with access to the GPS civilian ranging code called the coarse acquisition (CA) code that modulates the L1 (1575.42 MHz) signal. The GNS is a state-of-the-art spaceborne system optimized for autonomous on-orbit operations. The GNS is radiation tolerant, has extensive command and telemetry capability, provides access to raw and intermediate data products, supports on-orbit software reprogramming, is designed to accommodate the large doppler signal. dynamic range resulting from orbital velocities, and implements robust signal acquisition, navigation, and orbit determination algorithms.

BRIEF DESCRIPTION OF THE DRAWINGS

[0028]FIG. 1 is a simplified line drawing of the TIMED spacecraft illustrating the relative positioning of the major subassemblies.

[0029]FIG. 2 is a simplified block diagram of the TIMED GPS Navigation System (GNS).

[0030]FIG. 3 is a block diagram of the hardware implementation of the GNS.

[0031]FIG. 4 is a block diagram of one of the RF front ends.

[0032]FIG. 5 is a functional diagram of the baseband electronics subsystem identifying hardware and software components.

[0033]FIG. 6 is a simplified block diagram of the GPS tracking application specific integrated circuit (GTA).

[0034]FIG. 7 is a schematic diagram of one of the four input latch and I/Q generator channels of the GTA.

[0035]FIG. 8 is a functional block diagram of one of the 12 tracker channels of the GTA.

[0036]FIG. 9 is a block diagram of the carrier numerically controlled oscillator, NCO, which functions as a local oscillator for the final down conversion at the head end of a tracker channel.

[0037]FIG. 10 is a block diagram of the numerically controlled oscillator used to clock the GPS coarse acquisition code.

[0038]FIG. 11 is a block diagram of the GPS coarse acquisition code generator.

[0039]FIG. 12 is a block diagram of the clock and interrupt generation unit.

[0040]FIG. 13 illustrates the time error conventions related to trajectory position.

[0041]FIG. 14 is a graphic depiction of Kalman crank interval subdivisions.

[0042]FIG. 15 is a graph of the MIC slew control.

[0043]FIG. 16 is a functional block diagram of the dual processor subsystem implementation of the GNS software.

[0044]FIG. 17 is a simplified hardware layout of the dual processor subsystem.

DESCRIPTION OF THE PREFERRED EMBODIMENT

[0045] The TIMED spacecraft major components include a system for sounding of the atmosphere using broadband emission radiometry to measure pressure, temperature and infrared cooling. This is the SABER instrumentation package. Located on the underside of SABER, FIG. 1, is a Global Ultraviolet Imager (GUVI) for obtaining temperature profiles and auroral energy inputs. A pair of NADIR S-band antennas are located with the GUVI.

[0046] A graphite epoxy optical bench is positioned on top of the SABER instrumentation package. The bench serves as a mounting base for the TIMED Doppler Interferometer (TIDI) profiler and four TIDI telescopes that constitute the TIMED Doppler Interferometer system which obtains wind and temperature profiles. A pair of star cameras, positioned on the bench, provide inputs to attitude star trackers which supply the attitude knowledge requirements of the TIDI. Also positioned on the optical bench is the Solar Extreme-UV Experiment (SEE) which measures solar x-ray, UV and FUV irradiance and a pair of S-band antennas.

[0047] Power for the system is derived from a battery power supply augmented by two solar arrays.

[0048] The primary electronics for the TIMED system are contained in an integrated electronics module (IEM). The system is redundant, being comprised of two IEMs, IEM #1 and IEM #2, see FIG. 3. Each IEM includes a 2.5 Gbit SSR with command and telemetry interface on a command and data handling card. An RF telecommunications card includes an uplink receiver and down link transmitter. A DC/DC converter card, 94, contains a pair of voltage converters. Also contained in each IEM is a GPS navigation system, GNS. Each GNS includes a GPS receiver card, 10, and a processor card, 90, containing dual Mongoose V processors.

[0049] The GPS navigation system provides: 1) estimated position and velocity of the satellite; 2) estimated UTC time and transfer to the command and data handling card; 3) estimated earth-sun vector data; 4) position-based event notifications; 5) position-based event predictions; 6) autonomous orbit determination; 7) data for non-GPS navigation; and 8) support for on-orbit software up-loading.

[0050] The GPS navigation system, i.e., GNS, operations and specifications are presented in Table 1. TABLE 1 GNS Operations and Specifications. Parameter Operation or Specification Position (P) <300 m (3 σ), Geodetic latitude, longitude, height (<10 m predicted) Velocity V) <25 cm/sec (3 σ), east, north, up (<5 cm/sec predicted) Coordinate frame ECEF-CTS (ECI-CIS for use by attitude system) Earth-Sun vector (S) 0.06° (3 σ) Time of validity of PVS UTC 1-sec epochs Time, output signal (T) 100 μsec (3 σ) (<1 μsec predicted) Time, output data (T) CCSDS Unsegmented Time Code (CUC) Epoch: OH, Jan. 6, 1980 Data rate of PVST 1 Hz Event notification (E) Notify spacecraft of events, 5 sec uncertainty Terminator crossing: primary and backup Events: ground contacts: SAA; polar region Orbit determination Every 12 hours, predict forward 60 hours Data format: NORAD 2-line element set and one state vector per ground contact Event predictions Every 12 hours, predict forward 60 hours Non-GPS navigation No accuracy reqs; errors grow w/atmospheric density uncertainty Autonomous operations TTFF <30 mm, (cold start) 90% probable; <2 min (warm start) Uploads accepted: Solar flux; Geomag. Index; Polar wander; UTI- GPS time offset Input voltage ±15 Vdc and ±5 Vdc Power dissipation ≈7 W (1.5 W not including processors) Physical configuration Two 2-sided stretch SEM-E circuit boards + preamp + antenna Radiation 5 krads (Si); latch-up immune (GTA & proc. >1 Mrad, RF IC: ≧50 krads)

[0051]FIG. 2 is a simplified block diagram of the GNS. The receive antenna, 11, is located on the optical bench on the zenith-pointing surface of the orbital platform. The preamplifier, 12, consisting of pre-select filters and a low noise amplifier, is located just underneath the optical bench. The preamplifier generates the dominant component of system thermal noise power and conditions the received signals and noise for processing by the RF downconverter, 13. The downconverter, using a low-noise, temperature-compensated crystal oscillator (TCXO) as a frequency reference, downconverts L-band signals to the baseband and converts the resultant analog signal to a two-bit, three-level digital signal.

[0052] At the heart of the electronics is a low-voltage, low-power, radiation-hardened, high-speed application specific integrated circuit (ASIC), 15. This GPS Tracking ASIC (GTA) implements all the GPS-specific digital hardware functions.

[0053] The received GPS signals are converted to baseband digital signals and input to the GTA from the downconverter, 13, via a baseband electronics interface board. The GTA, under software control, implements 12 independent GPS tracking channels, 16, provides timing and control functions, and incorporates a built-in-test capability. The device is designed to accept up to four downconverted inputs to support future attitude determination capabilities and can be daisy-chained to support over 72 tracking channels. It will support P/Y code operations with additional external hardware.

[0054] The GNS's computer system, 90, comprises two Mongoose V radiation-hardened 32-bit processors, the tracking processor (TP), 91, and the navigation processor (NP), 92, and associated memory and interface support circuitry. Each Mongoose V operates at 12 MHz with no wait states for memory access. The two-processor approach is used to ensure adequate processor throughput. In an alternate embodiment, a single processor, such as a 20-MHz Mongoose V processor is used. The tracking processor, 91, implements the GNS acquisition, tracking, and data preprocessing functions, and outputs its products to the navigation processor, 92. Optimized “lost in space” or “sky search” signal acquisition algorithms may be executed on the tracking processor. These algorithms are designed to minimize the cold-start time-to-first-fix and to minimize the likelihood of on-orbit GNS signal acquisition problems. The navigation processor, 92, implements numerous functions including the command, control, and telemetry processing, and the navigation and orbit determination algorithms including a 45-state extended Kalman filter, orbit propagator, event detector and predictor, and an orbit element set generator.

[0055] The GNS is implemented redundantly on two identical TIMED Integrated Electronics Modules (IEM), each of which includes a GNS receiver card, 10, and a GNS dual-processor card, 90, see FIG. 3. The receiver card, 10, and processor card, 90, interface to each other and to the rest of the IEM via a backplane bus, 93. Regulated DC power, 94, and discrete reset signals are input to each card and discrete analog telemetry signals and a 1 PPS signal, steered to align with UTC, are output via the Cmd & Telemetry card, 95. The interface to the IEM's command and data handling (C&DH) system, 96, including input commands and all output data products, is provided through a 16-bit, 2.5-MHz (40 Mbps) implementation of the PCI bus through the backplane connector.

[0056] Six major elements comprise each GNS, they are: 1) a GNS micro-strip antenna, 11; 2) an RF subsystem on a GNS receiver card, 10; 3) a baseband electronics subsystem on the GNS receiver card, 15; 4) a dual processor subsystem on an independent GNS dual processor card, 90; 5) an IEM backplane bus I/O network, 93; and 6) the system soft-ware, FIG. 16.

[0057] GNS Antenna

[0058] Each GNS antenna is a single-element microstrip patch bonded to a truncated, cone-shaped ground plane. The antenna is painted with a thermal control paint and coated with 1200 angstroms of SiO₂ to protect the paint from atomic oxygen erosion on orbit. The element is tuned, after compensation for the effects of the paint, to receive right-hand circular polarized (RHCP) signals at the GPS L1 frequency of 1575.42 MHz with a nominal bandwidth of 5 MHz. In the preferred embodiment, the antenna is a modification of a space-qualified design produced by Ball Aerospace and Technology Corp. The shaped ground plane provides excellent gain (nominally≧2.5-dBiC) at ≧10° elevations. Antenna gain on the order of +5 dBiC is achieved at zenith. To eliminate obstruction of the GPS signals and to minimize multipath effects, the antenna is mounted on top of a graphite epoxy pedestal, which in turn, is mounted on the zenith optical bench, providing a full hemisphere of unobstructed coverage.

[0059] RF Subsystem

[0060] The RF subsystem, FIG. 3, is comprised of a GNS Receiver Card, 10, for each GPS antenna, 11. Each receiver card, 10, includes four RF preamplifier modules, 12, which are space-qualified COTS devices with a preselect L1 filter and a low-noise amplifier, 122 of FIG. 4. The filter is comprised of a 3-dB bandwidth at 30 MHz element, 1231 and a 90-dB bandwidth at 250 MHz element, 123. It amplifies the band-passed raw received signal and applies it to an RF, L-band downconverter module, 13.

[0061] The downconverter, 13, is based on a COTS triple-superheterodyne downconverting integrated circuit, such as a Plessey 6P2010, adapted for the GNS design. It is a plastic encapsulated microcircuit (PEM). There are eight downconverters, 13, on a GNS receiver card, 10, but only one is illustrated for simplicity as in the case of the eight RF preamplifiers, 12.

[0062] A PPL frequency synthesizer, 19, functions as the local oscillator for the downconverter. It is driven by the fundamental reference oscillator, 17, which is a high-stability, low-noise TCXO crystal oscillator. The oscillator's phase noise is less than 45 dBc at 1 Hz offset from the carrier and −95 dBc at 10 Hz with stability of less than ±1 part per million (PPM) over all operating temperatures. The reference oscillator, 18, also generates the system clock for the GTA. A surface acoustic wave (SAW) filter, 18, in the second intermediate frequency (IF) circuit provides filtering of out-of-band signals and noise and establishes the system bandwidth.

[0063] There are four RF receiver channels on each GNS receiver card, 10. Each receiver channel comprises two RF preamplifier modules, 12, and two RF downconverter modules, 13, supplying a set of complementary I and Q signals. Thus the eight RF preamplifier/downconverter circuits provide sampled two-bit, three-level signals in four sets of complementary I-signals, comp1 and comp2, and complimentary Q-signals, comp1 and comp2, for digital processing.

[0064] A block diagram of one of the RF front ends is presented by FIG. 4 to illustrates how the GPS signal is downconverted and digitized in the preamplifiers, 12, and downconverters, 13. These modules produce a single pair of complimentary outputs as I-signals or Q-signals. After downconversion, the signal is buried in noise but it is extracted as the state of a three level quantizer, 14. The outputs of the eight quantizers, as I-signal or Q-signal comp1 and comp2, are applied to the baseband electronics module, 15 of FIG. 3, as the four GPS receiver channel output signal pair sets, comp1 and comp2 for I and Q signals. The signals are applied to an associated one of the four input channels of the GPS tracking application specific integrated circuit, 16, which is part of the baseband electronics system, 15.

[0065] Baseband Electronics Subsystem

[0066] The baseband electronics subsystem is comprised of the hardware and software elements illustrated in FIG. 5. The software element is an extended Kalman filter process executed by microprocessors on the processor cards 90. The hardware is comprised of processor cards 90 and receiver cards 10 which are constructed around a GPS tracking application specific integrated circuit or GTA.

[0067]FIG. 6 is a simplified block diagram of the GTA. It is implemented in radiation hardened CMOS circuitry providing 12 independent tracker channels, 20, for acquiring and tracking the downconverted GPS signals from four receiver channels. The GPS downconverted signals are applied to the GTA input which comprises four identical IF input channels, each of which includes a data latch, 22, and an I/Q generation module, 23, for adapting various input formats to the needs of the GTA circuitry and program routines. The I/Q generation modules supply quadrature and non-quadrature in-phase data to a data router, 21, which feeds the data to an available one of the 12 tracker channels, 20, as a function of channel availability and GPS satellite source. The GTA is relatively self contained in that it includes a time base, a clock, an interrupt generator, 24, and a 16-bit microprocessor memory-mapped interface, 25. Each of the 12 tracking channels, 20, incorporate full in-phase and quadrature (I&Q) tracking loops that correlate local replicas of the GPS PRN codes with the received signals. When acquiring and tracking GPS signals, numerically controlled oscillators (NCOs) are steered by the tracking processor's control loop filters to force alignment of the received PRN codes and the locally generated replicas clocked by the NCOs. Similarly, the reconstructed transmitted carrier signal is tracked by a carrier tracking loop. Each of the 12 channels also serve as a signal search engine when new GPS satellites come into view of the GNS antennas.

[0068] The GTA handles a wide variety of sampled data inputs. The expected forms of sampled input to the GTA include both 1 bit and 1.5 bit versions of quadrature (I&Q) and non-quadrature (I only) outputs from the downconverters. Quadrature inputs are desirable when the downconversion process results in spectral folding due to a lower than nominal sampling rate. The losses of spectral folding are recovered when quadrature samples are used in a single side-band (SSB) carrier mixing process which removes the image frequency in the signal band. If spectral folding does not occur in the downconversion process, the non-quadrature (I only) samples are adequate.

[0069] Regardless of the GPS signal data type received from the RF downconverters, 13, it is applied to one of the four input channels to the GTA. FIG. 7 is a schematic diagram of the input latch, 22, and I/Q generator, 23, circuits which form each of the four input channels. The latch circuit includes a pair of exclusive NOR gates, 31 and 32, which route the data in separate non-quadrature, I, and quadrature, Q, paths to enable the system to obtain an ideal set of quadrature sampled data. The I and Q input signals are each comprised of complimentary outputs comp1 and comp2. This approach is used because of its inherent immunity to phase imbalances which exists between carriers in the quadrature downconverters. Each exclusive NOR gate, 31 and 32, provides inputs to the I/Q multiplexers 33 and 34. The multiplexers, 33 and 34, are each responsive to both exclusive NOR gate outputs and the comp2 inputs in the I and Q channels. The comp1 I and Q channel inputs are applied to a third multiplexer, 35. The three multiplexers, 33, 34, and 35, form the channel's I/Q generation module, 23, which enables the channel to handle different input formats and convert them to an output which the remainder of the GTA can recognize. There are eight different modes of operation which the I/Q generator can handle. Each mode is listed and described in Table 2 in terms of the output produced for the reset of the GTA. This table includes the definition of the 1.5 bit output signal in terms of two actual bits. During the I-only operation (Modes 5-7), the zero bit of the Q sample is set. The I/Q generation module 1.5 bit representations are presented in Table 3. TABLE 2 I/Q Generation Modes Mode Description 0 I & Q, 1 Bit, use comp1 input of both I & Q channels 1 I & Q, 1.5 bit, generate zeros from comp1 and comp2 inputs 2 I & Q, 1.5 bit, comp2=zero bit function for both I & Q 3 I & Q, 1.5 bit, generate quadrature data from non-quadrature data 4 I & Q, 1 bit, generate quadrature data from non-quadrature data 5 I, 1 bit, use comp1 input from I channel only 6 I, 1.5 bit, generate zero bit from comp1 and comp2 inputs 7 I, 1.5 bit, comp2=zero bit function for I only

[0070] TABLE 3 1.5 Bit Representations Signal Value Sample (1) Sample (2) −1 0 0  0 1 X (don't care)  1 0 1

[0071] The data router 21 acts as an intelligent distribution means for the outputs of the I/Q generators, 23. It provides an I sample and a Q sample input pair to one of the 12 tracker channels, 20. As seen in FIG. 8, the functional block diagram of one of the tracker channels, each tracker channel includes an I sample input, 41, and a Q sample input, 51, from the data router. The I and Q sample channels are identical so only the I sample channel is discussed in detail. It is comprised of a suming network 43 which combines the outputs of two carrier mixing operations, 42 and 45. The first mixing operation, 42, multiplies the I sample input, 41, with a cosine function from the phase mapping generator 44. The other mixing operation, 45, multiplies the Q sample input 51 with a sine function from the phase mapping generator 44. The output of the summing network 43 is re-clocked with a flip-flop 46 which provides parallel outputs to the three code mixers comprised of accumulators 47 and associated latched registers 48 and an un-mixed output 49.

[0072] The Q sample channel is nearly identical to the I sample channel. It is identified in FIG. 8 by reference designators 51, 52, 53, 55, 56, 57, 58 and 59 which provided functions similar to those provided by the circuit elements 41, 42, 43, 45, 46, 47, 48 and 49 of the I sample channel. The key difference is the summing operation 53 is indicating the difference between the mixing outputs 55 and 52.

[0073] The outputs of the flip-flops 46 and 56 represent the final downconversion process which is achieved using an adjustable local oscillator frequency to accommodate the variable Doppler shift present in the GPS downlink. A numerically controlled oscillator, the carrier NCO, 54, generates a digitally responsive version of the local oscillator frequency required for the final downconversion process. A block diagram of the oscillator is presented in FIG. 9. It uses a 24-bit full adder, 67, to provide the sequential logic which is clocked at the sample rate of the signal by latch 61 and kept in phase with sample by the phase and rate of phase change circuit 68. The three most significant bits, MSBs, of the adder provide the phase output, 62, to the mixing process in the sample channels via the phase mapping means 44. The carrier NCO provides the system with an ability to vary local oscillator frequency. A register, 63, allows the system to read the current phase information. The system can set the NCO output to 0s at anytime. The carrier NCO has a 32 bit counter, 64, with which it keeps track of the number of carrier cycles occurring during each measurement period and provides integrated Doppler estimates during GPS tracking. It's value is read by the microprocessor on each measurement interval. The carrier cycle counter and NCO phase are set to 0 by either an align_time condition or an nco_car_clear condition. The controls are maintained by the microprocessor and actions occur only on the first positive edge of the MIC signal following a clear request. The 3 bit phase output of the carrier NCO, 54, is mapped to sine and cosine components according to Table 4. TABLE 4 Carrier NCO Phase Mapping Carrier NCO Phase Cosine Value Sine Value 000 +2 +1 001 +1 +2 010 −1 +2 011 −2 +1 100 −2 −1 101 −1 −2 110 +1 −2 111 +2 −1

[0074] Three fundamental signals act as inputs during the carrier mixing process in FIG. 8. The three signals are the two quadrature sample data components, Isamp, 41, and Qsamp, 51, and three bits of phase from the carrier NCO, 54. The two quadrature carrier components, cosine and a sine, are generated by the phase mapper, 44, from the carrier NCO phase information according to the data presented in Table 4 . The carrier mixing process is similar to processing employed for single sideband modulation (SSB). This technique provides a large amount of image rejection. It is used to prevent image products from folding back down to the desired signal band and corrupting the signal. The fundamental mixing process is represented by the equations:

I=Isamp*cos+Qsamp*sin

Q=Isamp*sin−Qsamp*cos

[0075] The carrier mixing process is implemented with multiple-bit accuracy. The input samples, Isamp and Qsamp, have the values −1, 0, or +1. The sine and cosine components from the carrier NCO have the values −2, −1, +1, and +2. This results in mixing outputs which can take on the values 0, ±1, ±2, ±3, and ±4. These values are represented by a four bit binary output defined in Table 5. The outputs are re-clocked at the sample clock rate for timing considerations. TABLE 5 Multi-Value Bit Definition Value Binary −4 0000 −3 0001 −2 0010 −1 0011  0 1XXX  1 0100  2 0101  3 0110  4 0111

[0076] The numerically controlled oscillator, NCO, which clocks the GPS course acquisition code generator circuit, the CA code NCO, 88, is similar to the carrier NCO, 54. A block diagram of the CA code NCO 88 is presented in FIG. 10. To emphasize the similarity between the NCOs 54 and 88, common reference designators are used to indicate identical circuits in FIGS. 9 and 10. For instance, in FIG. 10, the CA code NCO phase and rate of phase change is set by register, 68, which is identical to register 68 in FIG. 9. It is also controlled by the microprocessor bus as in the carrier NCO. The phase increment register, chx_code_phincr, is used to set the phase offset incremented to the current phase at every sample clock time as in the carrier NCO. The current phase clock of the CA code NCO, 88, is read at the current phase register, 63, by performing a microprocessor read from the address chx_codenco_phase as with the current phase register 63 of the carrier NCO, 54,. Verification of correct CA code NCO operation is determined by directing the microprocessor to clear the current phase prior to the next phase addition by setting the appropriate bit in the register nco_code_clear. This clear operation occurs at the next measurement interval clock, MIC, cycle.

[0077] The GPS coarse acquisition code numerically controlled oscillator, CA code NCO, 88 of FIG. 8, provides an output to the GPS course acquisition code generator 70. A block diagram of generator 70 is illustrated in FIG. 11. It incorporates two shift registers, 71 and 72, which generate the PRN codes that are summed together by the modulo-2 summing means 73 to produce the desired GPS coarse acquisition code. Each shift register is clocked on the negative edge of the CA code NCO fchip to ensure that the code generator is initialized at a specific time so the current phase of the code may be derived from a code phase counter. The code phase counter, 74, is a 10-bit counter that resets to a value of zero at every epoch and increments by one on every chip. Critical timing is achieved with the use of the align_time signal form the microprocessor along with the MIC signal. Different codes corresponding to each GPS space vehicle are generated by verying the initial phase of the lower shift register. It is possible to start generation of a GPS course acquisition code at a point besides its epoch by initializing the top register to something other than all 1s.

[0078] The next step in processing consists of mixing the signals, i.e. the outputs of the differentiators 46 and 56, with a locally generated replica of the code used during the data modulation produced by CA code generator 70. This process occurs simultaneously in six differential mixing circuits, 81 through 86, for every tracker. The purpose is to lock frequency and phase of the code present on the received signal with a locally generated code. Both the I and Q outputs of the carrier mixing are multiplied by three time-shifted versions of the local code produced by the 3-bit shift register 87. This results in a total of six code mixing and correlation operations per tracker. Early, prompt, and late time-shifted versions of the code are used because their ½ chip delay offsets provide good code acquisition and tracking performance.

[0079] The code mixing process is illustrated in the functional block diagram of a single tracker in FIG. 8. The components of the I and Q carrier mixing products are clocked at the input sample rate and the code to be mixed with them is clocked at twice the CA code numerically controlled oscillator rate, i.e., CA code NCO, 88, rate. Because the CA code NCO is clocked at the sample rate, data transitions for all of the involve signals occur on the same boundaries. Both the I and Q carrier mixing products are adjusted so they are represented by the values 0, ±1, ±2, ±3, and ±4. Using the code values ±1, the output of the code mixers, 81 through 86, take on the same range of values as the outputs of the carrier mixing process.

[0080] After the code mixing process, the GPS signal outputs IE, IP, IL, QE, QP, and QL are loaded in the registers forming the appropriate accumulators, 47 and 57. Because the accumulator can be implemented easier as an up-counter instead of an up/down-counter, the representation of the mixer outputs is changed by adding an offset of +4 to the mixer outputs. The new values represent the increment value corresponding to each possible code mixing output. The process is repeated for subsequent values of the products coming out of each code mixer. This represents the correlation operation of a GPS receiver. See Table 6. TABLE 6 Relationship of Code Mixing Output to Counter Increment Code Code Counter Counter Mixing Value Mixing Bindery Increment Value Increment Binary −4 0000 0 0000 −3 0001 1 0001 −2 0010 2 0010 −1 0011 3 0011  0 1XXX 4 0100  1 0100 5 0101  2 0101 6 0110  3 0110 7 0111  4 0111 8 1000

[0081] The six accumulator values from the code mixing outputs of each tracker are normally latched into a register 48 or 58, at every internally generated code epoch. However, to reduce the load on the microprocessor, each tracker has the capability of latching the data at a multiple number of epochs. Each tracker can be program so that anywhere from 1 to 20 epochs may occur between latching of the accumulator contents.

[0082] The timebase, clock, and interrupt generator, 24, create all timing and interrupt signals for the GTA. Certain portions of the clock generator work specifically with the TIMED frequency plan while other parts of the generator are adapted to provide different frequency and timing requirements. FIG. 12 is a block diagram of the timing and interrupt generator. The generator is normally driven by the same sample clock that the rest of the GPA uses for data processing.

[0083] A common clock or timing signal is required to efficiently allow the microprocessor to download the latched accumulator values between epoch states. This download signal, the accumulator or interval clock (AIC), occurs at a 1.499812 kHz rate or a period of 666.75 microseconds. It is used to generate an interrupt for the microprocessor.

[0084] The measurement interval clock (MIC) is a timing signal used to notify the microprocessor when measurement readings are to be be made. The MIC is used as a reference time for aligning other signals such as the carrier and CA code NCOs and code generator outputs. The MIC has four different, selectable rates, they are 100 Hz, 10 Hz, 1 Hz and 0.1 Hz. During applications requiring critical timing measurements, a 1 PPS signal is used as the MIC. When using one of the internal MIC rates, this signal is a non-square waveform with a positive pulse width of two AIC clock periods, or 1333.34 microseconds.

[0085] The time base generation circuit provides a 1 pulse-per-second (pps) UTC clock reference that is used to control the TIMED spacecraft timing system. Under control of a tracking loop in the navigation processor's extended Kalman filter, a numerically controlled oscillator is continually controlled such that it outputs a 1-PPS signal that is steered to align it with UTC's 1-second epochs. This is accomplished by using a 25-bit synchronous divider (counter) which is clocked by the sample_clk signal. When the counter reaches a value set by the microprocessor, the 1 PPS signal is set high and the counter resets to zero. The 1 PPS signal is then set low halfway through the next count to create a clock with a 50% duty cycle. This clock is capable of being aligned with UTC time by modifying the 25 bit maximum count value. Initially the 1 PPS divider is aligned with the MIC signal. This is achieved whenever an align_time signal occurs.

[0086] The time offset between the MIC and a 1 PPS signals must be measurable. The measurement is obtained with a second counter that determines the time interval between the 1 PPS rising edge and the next MIC rising edge. Two registers hold the number of sampleclk cycles which occurred between the two signals.

[0087] The GTA is implemented on a radiation-hardened HR23OO series CMOS gate array produced by Honeywell Solid State Electronics Center. The GTA uses over 200,000 gates, operates on 3.3 V for internal circuits and 5 V for input/output, and dissipates ≈200 mW..

[0088] Receiver Timing

[0089] Receiver timing is unique for TIMED. The receiver contains a fundamental oscillator which drives a group of frequency dividers, one of which is coupled into the receiver clock to produce a function of true time which is uncontrolled or open loop time. Controlled time is created by a control process that drives the system time bias to zero. The process is modeled as a continuous time adjustment to frequency error which converts an uncontrolled time function to a controlled time function of true time for use by the Kalman filter.

[0090] Correct modeling of the TIMED orbital dynamics and the GPS measurements is key to achieving good navigation performance. This includes having adequate gravity and drag models and correct modeling of the measurements derived from the GPS receiver carrier and code tracking loops. Modeling the effects of the receiver clock error on the measurements is critical. A unique feature of the GNS receiver is the control of the sampling times of the tracking loops to align with Universal Coordinated Time (UTC) time tics.

[0091]FIG. 4 illustrates how the GPS signal is downconverted and digitized by preamplifier 12 and downconverter 13. These circuit uses a Plessy RF front end and the GPS\L1 signal is downconverted from 1575.42 Mhz to 4.3 MHz. This technology leaves the signal buried in noise. The final output of the module is the state of a three level quantizer, 14.

[0092] The outputs of the quantizer are processed by an application-specific integrated circuit, as shown in FIG. 6. As previously stated, the ASIC chip includes twelve replications of a GPS tracker, so up to twelve GPS satellites can be tracked. The signals are sampled and distributed to the 12 trackers by four receiver channels. In the trackers, this signal samples are digitally mixed with a local carrier and code. The sampling accomplishes an additional downconversion of the L1 signal to −1.4054 Mhz. The negative sign arises because the signal is oversampled and downconverted through zero frequency. This results in a reversal of sign in the Doppler shift. After lockup, the local carrier and code are in phase with the received carrier and code. The GPS message data is retrieved inside the carrier tracking loop as the pseudo-range and integrated carrier. The data is manipulated by an extended Kalman filter implemented by software in the mongoose microprocessors.

[0093] The software used by the system is presented by way of mathematical functions to avoid hardware and programing language ambiguities. To simplify the presentation, the analysis considers the pseudo-range and integrated carrier produced by the code epoch accumulator and the carrier phase accumulator using the output of a single exemplary tracker channel. These accumulators are sampled at interrupts generated by the Measurement Interrupt Clock (MIC). The timing of this interrupt is controlled by the Kalman filter so that at steady state, it occurs as close to the UTC time tics as possible. Since this is different than what normally occurs in a Kalman processed GPS evaluation, a thorough discussion of the receiver timing is presented. Receiver timing is developed by the GNS software which implements the following equations, where:

[0094] Vectors/matrices are represented as lower/upper case (x/T). The transpose of a vector or matrix is denoted as x^(t). For quantities that depend on a particular tracking channel, the tracking channel superscript ν is used. Thus σ^(ν) is the pseudo-range associated with tracking channel ν. Quantities associated with GPS satellites are identified by their tracking channel index (as opposed to their PRN or SV numbers). Thus x^(ν)(τ) is the position implied by the GPS message ephemeris for the satellite being tracked by channel ν. Estimates are denoted as {circumflex over (x)}. Reference receiver time is denoted by t while true time is denoted by τ. The reference times at the MIC interrupt event are denoted by t_(k). Sometimes t_(k) is used to denote a general Kalman filter update time. (Note that these form a subset of the MIC times since a measurement is processed every m^(th) MIC interrupt.) The apriori/aposteriori estimates of quantities at t_(k) are denoted as {circumflex over (x)}_(k/k−1)/{circumflex over (x)}_(k/k). Unless otherwise stated, all vector quantities are expressed in the Conventional Inertial System (CIS).

[0095] Basically, the system uses an imprecise clock. To develop error equations for a navigation system which contains an imprecise clock, a precise definition of error is required. This is accomplished in the software by defining the asynchronous errors as:

δ_(a) x(t)≡x(t)−x ^(ref)(t)

[0096] where x(•) is any function of time, x(t) is its true value, and x^(ref)(t) is its reference value according to the GNS system. Similarly, the synchronous errors are defined as:

δ_(s) x(t)≡x(τ(t))−x ^(ref)(t)

[0097] where τ(t) is a function that takes the nominal time t of the GNS system into the corresponding true time. This situation is illustrated graphically in FIG. 13, where τ(t)>t is assumed. If the difference τ(t)−t is small, and the difference between the true trajectory and the reference trajectory is small, the following relations hold between the two error conventions:

δ_(s) x(t)≈δ_(a) x(t)+{dot over (x)}(t)(τ(t)−t)  (1)

[0098] where {dot over (x)}(t)≡dx/dt.

[0099] The synchronous error is the error in x^(ref)(t) ignoring the time tagging errors of the GNS clock, while the asynchronous error takes these errors into account. If the difference between the indicated and true time to be the state is defined as T≡t−τ(t), the appropriate transformation between asynchronous and synchronous errors is: $\begin{bmatrix} {\delta_{s}{x(t)}} \\ {T(t)} \end{bmatrix} = {\begin{bmatrix} I & {- {\overset{.}{x}(t)}} \\ 0 & 1 \end{bmatrix}\begin{bmatrix} {\delta_{a}{x(t)}} \\ {T(t)} \end{bmatrix}}$

[0100] and the associated suitably partition covariance is: $\begin{bmatrix} {{cov}\left( {\delta_{s}x} \right)} & {{cov}\left( {{\delta_{s}x},T} \right)} \\ ({symm}) & {{cov}(T)} \end{bmatrix} = {{\begin{bmatrix} I & {- {\overset{.}{x}(t)}} \\ 0 & 1 \end{bmatrix}\begin{bmatrix} {{cov}\left( {\delta_{a}x} \right)} & {{cov}\left( {{\delta_{a}x},T} \right)} \\ ({symm}) & {{cov}(T)} \end{bmatrix}}\begin{bmatrix} I & {- {\overset{.}{x}(t)}} \\ 0 & 1 \end{bmatrix}}^{t}$

[0101] For most sections in the following development, the synchronous error convention will serve as the default. It will be written without a subscript.

[0102] For the uncontrolled time receiver reference times, Let τ represent the independent variable true time. The receiver contains a fundamental oscillator with instantaneous frequency ƒ₀(τ)¹. (For the TIMED GNS receiver using a Plessy RF Front End, ƒ₀ is nominally 10 MHz.) It drives a group of frequency dividers, one of which is coupled into the receiver clock. The output of this frequency divider as a function of true time is: $\begin{matrix} {{s(\tau)} = {\sin \left( {\frac{1}{k_{c}}\left\lbrack {{\int_{\tau_{set}}^{\tau}{2\pi \quad {f_{0}(\xi)}}} + \varphi_{set}} \right\rbrack} \right)}} \\ {= {\sin \left( {{\phi (\tau)}/k_{c}} \right)}} \end{matrix}$

[0103] where k_(c) is the (rational) divide-down ratio. (For TIMED the system clock is coupled directly into the fundamental oscillator, so that k_(c)=1) The true time at which the clock was set is τ_(set), the phase (in radians) of the fundamental oscillator is ϕ(τ) = 2  π  ∫_(τ_(set))^(τ)f₀(ξ)ξ + φ_(set), and  φ_(set) ∈ [0, 2  π]

[0104] is an arbitrary phase of the fundamental oscillator at τ_(et). The number of complete cycles executed by this sinusoid since τ_(set) is N_(cycles)(τ)=floor[(φ(τ)−φ_(set))/2πk_(c)]. If ƒ₀ ^(ref) cycles per second are being executed by the fundamental oscillator, the estimate of time is: ${t^{*}(\tau)}\begin{matrix} {= {\frac{k_{c}{N_{cycle}(\tau)}}{f_{0}^{ref}} + t_{set}}} \\ {= {\frac{k_{c} \cdot {{floor}\left\lbrack {{\left( {{\phi (\tau)} - \varphi_{set}} \right)/2}\quad \pi \quad k_{c}} \right\rbrack}}{f_{0}^{ref}} = t_{set}}} \end{matrix}$

[0105] where t_(set) is the value placed in the clock at τ_(set). Dispensing with the floor function since all times of interest (the sampling times) occur when the oscillator has executed an integral number of cycles (i.e. when (φ(τ)−φ_(set))/2π is an integral multiple of k_(c)). Then: $\begin{matrix} \begin{matrix} {{t^{*}(\tau)} = \frac{{\left( {{\phi (\tau)} - \varphi_{set}} \right)/2}\quad \pi}{f_{0}^{ref}}} \\ {= {{\int_{\tau_{set}}^{\tau}{\frac{f_{0}(\xi)}{f_{0}^{ref}}{\xi}}} = t_{set}}} \\ {= {{\int_{\tau_{set}}^{\tau}{\left( {1 - {ɛ(\xi)}} \right){\xi}}} + t_{set}}} \\ {= {t_{set} + \left( {\tau - \tau_{set}} \right) - {\int_{\tau_{set}}^{\tau}{{ɛ(\xi)}{\xi}}}}} \end{matrix} & (2) \end{matrix}$

[0106] where the fractional frequency error is defined by: $\begin{matrix} {{ɛ(\tau)} \equiv \frac{f_{0}^{ref} - {f_{0}(\tau)}}{f_{0}^{ref}}} & (3) \end{matrix}$

[0107] This is the uncontrolled or open loop time. If t_(set)=τ_(set) and f₀(ξ) = f₀^(ref)

[0108] there will be no error and t*(τ)=τ. Since this is not the case, there will be an error defined by: $\begin{matrix} \begin{matrix} {{T^{*}(\tau)} = {{t^{*}(\tau)} - \tau}} \\ {= {t_{set} - \tau_{set} - {\int_{\tau_{set}}^{\tau}{{ɛ(\xi)}{\xi}}}}} \end{matrix} & (4) \end{matrix}$

[0109] Note that t*(τ) is the function that takes true time into the simultaneous uncontrolled reference time. Note also that the divide-down ratio k_(c) does not appear. This function is inverted to obtain the true time, τ(t*), as a function of uncontrolled reference time. This function is defined implicitly by: $\begin{matrix} {t^{*} = {t_{set} = {\left( {{\tau \left( t^{*} \right)} - \tau_{set}} \right) - {\int_{\tau_{set}}^{\tau {(t^{*})}}{{ɛ(\xi)}{(\xi)}}}}}} & (5) \end{matrix}$

[0110] The instantaneous phase of the fundamental oscillator is recovered from t*(τ) by solving equation (2) for φ(τ) to get: $\begin{matrix} {{\phi (\tau)} = {{2\pi \quad {f_{0}^{ref}\left( {{t^{*}(\tau)} - t_{set}} \right)}} + \varphi_{set}}} \\ {= {2\pi \quad {f_{0}^{ref}\left( {{\left\lbrack {\tau = {T^{*}(\tau)}} \right\rbrack - t_{set}} = \varphi_{set}} \right)}}} \\ {= {{2\pi \quad {f_{0}^{ref}\left( {\tau = {T^{*}(\tau)}} \right)}} + \varphi_{set}}} \end{matrix}$

[0111] where φ_(set) has been modified to include t_(set), because only φ(τ) is significant, modulo 2π and (t_(set)2πƒ₀ ^(ref))mod(2π) can be absorbed in φ_(set).

[0112] The uncontrolled time thus far defined is used to derive controlled time by driving the system time bias to zero. A quantized and control in a discrete time system is modeled as a continuous time adjustment to the frequency error. Applying the control process to equation (2) produces: $\begin{matrix} {{t(\tau)} = {t_{set} + \left( {\tau - \tau_{set}} \right) - {\int_{\tau_{set}}^{\tau}{\left\lbrack {{ɛ(\xi)} - {u(\xi)}} \right\rbrack {\xi}}}}} & (6) \end{matrix}$

[0113] where t(τ) is the system reference time as a function of true time, including the control effects, and u(τ) is the continuous time process used to represent the control. Its dimensions are seconds/second (the same as fractional frequency error). Note that t(τ) is the function that takes true time into simultaneous controlled reference time. This function is inverted to obtain the true time, τ(t), as a function of controlled reference time. The inverse function is defined implicitly by: $\begin{matrix} {t = {t_{set} + \left( {{\tau (t)} - \tau_{set}} \right) - {\int_{\tau_{set}}^{\tau {(t)}}{\left\lbrack {{ɛ(\xi)} - {u(\xi)}} \right\rbrack {\xi}}}}} & (7) \end{matrix}$

[0114] Defining the (controlled) clock bias to be that quantity which when subtracted from the (controlled) reference time gives the corresponding true time: $\begin{matrix} \begin{matrix} {{T(\tau)} = {{t(\tau)} - \tau}} \\ {= {t_{set} - {\int_{\tau_{set}}^{\tau}{\left\lbrack {{ɛ(\xi)} - {u(\xi)}} \right\rbrack {\xi}}}}} \end{matrix} & (8) \end{matrix}$

[0115] The rate of change of T(τ) with respect to true time is then: $\begin{matrix} {\frac{T}{\tau} = {{- {ɛ(\tau)}} + {u(\tau)}}} & (9) \end{matrix}$

[0116] The Kalman filter runs according to receiver time, therefor the derivative of T(t)≡T(τ(t)) with respect to t. By the chain rule, this is $\begin{matrix} {\frac{{T(t)}}{t} = {\frac{{T\left( {\tau (t)} \right)}}{\tau} \cdot \frac{{\tau (t)}}{t}}} & (10) \end{matrix}$

[0117] {dot over (τ)}(t)≡dτ/dt is derived by differentiating equation (7) with respect to t using the Leibniz rule which produces:

1=(1−ε(τ(t))+u(τ(t))){dot over (τ)}(t)

[0118] or $\begin{matrix} {{\overset{\quad}{\overset{.}{\tau}}(t)} = \frac{1}{1 + {u(t)} - {ɛ(t)}}} & (11) \end{matrix}$

[0119] where ε(t)≡ε(τ(t)) and u(t)≡u(τ(t)). Substituting equations (11) and (9) into equation (10) yields: $\begin{matrix} \begin{matrix} {\frac{{T(t)}}{t} = \frac{{u(t)} - {ɛ(t)}}{1 + {u(t)} - {ɛ(t)}}} \\ {= {\left( {{u(t)} - {ɛ(t)}} \right){\overset{.}{\tau}(t)}}} \end{matrix} & (12) \end{matrix}$

[0120] The variables τ and t represent the true time and controlled reference time independent variables as well and the functions τ(t) and its inverse t(τ). The distinction is clear from the context. When appropriate, superscripts identify the system to which the time functions pertain. Thus, a reference time from the Guidance and Navigation System (GNS) leads to the corresponding true time:

τ(t)=t−T(t)  (13)

[0121] By a notational slight-of-hand, as in equation (13), functions may be accessed according to receiver time instead of true time. This is accomplished by writing T(t) to mean T(τ(t)). The GNS time t represents the number of seconds in the GPS standard epoch. It is stored in two variables so that precision will not be lost:

t _(k) =MIC_time_(k) +t _(int)

[0122] where MIC_time_(k) is the number of seconds since GNS turn-on and t_(int) is an integer that brings the sum MIC_time_(k)+t_(int) close to the desired value when time is initially set.

[0123] MIC slew control, u(t), is a continuous time representation of the digital process used to control the timing of the MIC interrupt in the GNS receiver so that it aligns with UTC tic boundaries. The GNS receiver continually estimates the difference between its internal clock and GPS time. The GPS time differs from UTC by an integer; therefore the GPS time tics are coincident with UTC tics. In the actual digital implementation, the MIC interval counter is strobed by ƒ₀/k_(c). An interrupt is generated and the counter resets when the counter reaches a value written into a memory location on the GPS Tracking ASIC (GTA). The desired number of clock cycles between MIC interrupts is known as the MIC register count and is determined from Kalman filter estimates.

[0124] The objectives of the digital control are to compensate for the time bias error and the fractional frequency errors, and to bring the MIC interrupt into coincidence with the UTC tics. The control will be applied across the whole Kalman update interval consisting of m MIC interrupts so the difference between the true and nominal MIC interval times can be minimized. As described earlier, the nominal time since the GPS standard epoch is constructed as:

t _(k) =MIC_time_(k) +t _(int)

[0125] The corresponding estimate of true time after a measurement update is found by removing the bias from the reference time:

{circumflex over (τ)}_(k/k) =MIC_time_(k) =t _(int) −{circumflex over (T)} _(k/k)  (14)

[0126] It takes far less time to eliminate the clock bias and to align the MIC with UTC tic's if the clock bias is removed by absorbing it in t_(int):

t _(int)

t _(int)−round{{circumflex over (T)} _(k/k)}

{circumflex over (T)} _(k/k)

{circumflex over (T)} _(k/k)−round{{circumflex over (T)} _(k/k)}  (15)

[0127] where round{x} is the closest integer to x, i.e.

round{x}=arg min_(iεz) |i−x|  (16)

[0128] where Z are the integers. It is clear that this redefinition leaves the estimate of true time given by equation (14) unchanged. This redefinition is done after every measurement update. If the MIC slew is operating in steady state, the time bias will be maintained at a very small value and this redefinition will not do anything. The absorption of the integral part of the clock bias will only happen after the first measurement update or if the MIC slew is deactivated.

[0129] Assuming τ_(k) denotes k^(th) sampling time, then the k^(th) MIC interrupt is triggered when the GTA MIC counter (which is strobed at the frequency ƒ₀/k_(c)) counts up to a prescribed value, n(k). The GTA MIC counter then resets. The true MIC interrupt times (τ_(k), k=1,2,3 . . . ) are thus defined by: ${\frac{1}{k_{c}}{\int_{\tau_{k - 1}}^{\tau_{k}}{{f_{0}(\xi)}{\xi}}}} = {n(k)}$

[0130] where τ₀ is the true turn on time.

[0131] The Kalman update interval contains m MIC intervals and a Kalman crank interval is: ${\frac{1}{k_{c}}{\int_{\tau_{k}}^{\tau_{k + m}}{{f_{0}(\xi)}{\xi}}}} = {\sum\limits_{i = {k + m}}^{k + m}{n(i)}}$

[0132] The update interval is divided into subsections of length p and q=m−p, as in FIG. 14.

[0133] For the first p MIC intervals, the measurement update calculations at t_(k) are still underway and a default MIC interval count n_(d) is used. The value for the default MIC interval count is based on the previously estimated fractional frequency error so that the true MIC interval times are as close to the nominal as possible: (If this is the first Kalman crank, the estimate comes from preflight calibration of the oscillator.)

n _(d)=round{Δ_(MIC)·ƒ₀ ^(ref)(1−{circumflex over (ε)}_(k−m/k−m))/k _(c)}

[0134] For the remainder of the Kalman crank interval, the MIC interval counts are calculated to minimize the time bias estimate predicted at the end of the crank interval: $\begin{matrix} {{\frac{f_{0}}{k_{c}}\left( {\tau_{k + m} - \tau_{k}} \right)} = {{pn}_{d} + {\sum\limits_{i = {k + p + 1}}^{k + m}\quad {n(i)}}}} & (17) \end{matrix}$

[0135] assuming ƒ₀(ξ) is slowly varying. Using the above definitions for the receiver time bias and frequency errors:

τ_(k) =t _(k) −T(t _(k))

[0136] then

τ_(k+m) =t _(k+m) −T(t _(k+m))

[0137] and f₀ = f₀^(ref)(1 − ɛ(t_(k)))

[0138] Substituting these values into equation (17) yields: ${\frac{f_{0}^{ref}\left( {1 - {ɛ\left( t_{k} \right)}} \right)}{k_{c}}\left( {t_{k + m} - {T\left( t_{k + m} \right)} - \left\lbrack {t_{k} - {T\left( t_{k} \right)}} \right\rbrack} \right)} = {{pn}_{d} + {\sum\limits_{i = {k + p + 1}}^{k + m}\quad {n(i)}}}$

[0139] Let Δ_(MIC)=t_(k+1)−t_(k) be the nominal MIC interval in seconds (=1 sec). Then t_(k+m)−t_(k)=m·Δ_(MIC), and: ${\frac{f_{0}^{ref}\left( {1 - {ɛ\left( t_{k} \right)}} \right)}{k_{c}}\left( {{m \cdot \Delta_{MIC}} - \left\lbrack {{T\left( t_{k + m} \right)} - {T\left( t_{k} \right)}} \right\rbrack} \right)} = {{pn}_{d} + {\sum\limits_{i = {k + p + 1}}^{k + m}\quad {n(i)}}}$

[0140] Minimizing to find the integer sequence n(i) which makes the clock bias at the next crank as small as possible: $\left| {T\left( t_{k + m} \right)} \right| = \left| {{m \cdot \Delta_{MIC}} + {T\left( t_{k} \right)} - {\left\lbrack {{pn}_{d} + {\sum\limits_{i = {k + p + 1}}^{k + m}\quad {n(i)}}} \right\rbrack \frac{k_{c}}{f_{o}^{ref}\left( {1 - {ɛ\left( t_{k} \right)}} \right)}}} \right|$

[0141] Note that this optimization problem defines only the sum of the sequence $S = {\sum\limits_{i = {k + p + 1}}^{k + m}\quad {n(i)}}$

[0142] and can be expressed in the form: $\begin{matrix} {\begin{matrix} {S^{*} = \left. {\arg \min\limits_{S \in Z}} \middle| {A - {SB}} \right|} \\ {= \left. {\arg \min\limits_{S \in Z}} \middle| {B\left( {{A/B} - S} \right)} \right|} \\ {= \left. {\arg \quad \min\limits_{S \in Z}} \middle| {{A/B} - S} \right|} \end{matrix}{where}:\begin{matrix} {A = {{m \cdot \Delta_{MIC}} + {T\left( t_{k} \right)} - {{pn}_{d}\left( \frac{k_{c}}{f_{0}^{ref}\left( {1 - {ɛ\left( t_{k} \right)}} \right)} \right)}}} \\ {B = \frac{k_{c}}{f_{0}^{ref}\left( {1 - {ɛ\left( t_{k} \right)}} \right)}} \end{matrix}} & (18) \end{matrix}$

[0143] By definition of the round function, the minimum of equation (18) is attained if: $\begin{matrix} \begin{matrix} {S^{*} = {{round}\left( {A/B} \right)}} \\ {= {{{round}\left\lbrack {\frac{f_{0}^{ref}\left( {1 - {ɛ\left( t_{k} \right)}} \right)}{k_{c}}\left( {{m \cdot \Delta_{MIC}} + {T\left( t_{k} \right)}} \right)} \right\rbrack} - {pn}_{d}}} \\ {= {{{round}\left\lbrack {\frac{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}{k_{c}}\left( {{m \cdot \Delta_{MIC}} + {\hat{T}}_{k/k}} \right)} \right\rbrack} - {pn}_{d}}} \end{matrix} & (19) \end{matrix}$

[0144] The last line is used for computation because the causal estimates are substituted for the true quantities ε(t_(k)) and T(t_(k)), which are unknown.

[0145] The optimal sum is generate by the following sequence which is preferred over other sequences because it produces a minimum variance from the optimal mean count value S*/q. The last q MIC intervals in the Kalman crank are divided into two groups, one with q_(ƒ) intervals using n(i)=floor(S*/q) as the MIC register count and one with

q _(c) =q−q _(ƒ) intervals with n(i)=floor(S*/q)+1 as the count:  (20) ${n(i)} = \left\{ {\begin{matrix} {n_{f} = {{floor}\left( {S^{*}/q} \right)}} \\ {n_{c} = {{{floor}\left( {S^{*}/q} \right)} + 1}} \end{matrix}\begin{matrix} {i \in \left\{ {k + p + {1,\quad k} + p + {2{,\ldots}\quad k} + p + q_{f}} \right\}} \\ {\quad {i \in \left\{ {{k + p + q_{f} + {1,\quad k} + p + q_{f} + 2},{{\ldots \quad k} + m}} \right\}}} \end{matrix}} \right.$

[0146] The sum of the sequence is: $\begin{matrix} {{\sum\limits_{i = {k + p + 1}}^{k + m}\quad {n(i)}} = {{q_{f} \cdot n_{f}} + {q_{c}n_{c}}}} \\ {= {{q_{f} \cdot n_{f}} + {\left( {q - q_{f}} \right)\left( {n_{f} + 1} \right)}}} \end{matrix}$

[0147] The integer q_(ƒ) that generates the minimum variance sequence that satisfies ${\sum\limits_{i = {k + p + 1}}^{k + m}{n(i)}} = {{S^{*}\quad {{is}:S^{*}}} = {{q_{f} \cdot n_{f}} + {\left( {q - q_{f}} \right)\left( {n_{f} + 1} \right)}}}$

[0148] which yields:

q _(ƒ) =q(n _(ƒ)+1)−S*  (21)

[0149] which is greater than zero, provided q, S*≧1. Then q_(c) is: $\begin{matrix} \begin{matrix} {q_{c} = {q - q_{f}}} \\ {= {S^{*} - {q \cdot n_{f}}}} \end{matrix} & (22) \end{matrix}$

[0150] During the period between the first two Kalman cranks, the MIC slew has to absorb time errors up to ½ second in magnitude. The MIC is disseminated to the spacecraft as a 1-PPS timing source. There for, the time between MIC interrupts cannot be shorter than 0.9999 seconds. (Δ_(MIC)=1 sec.) To ensure that this constraint is met in the presence of a 100 nanosecond time quantization on the GTA and clock estimation uncertainties, the GNS uses a tighter constraint of 0.9999+100×10⁻⁹+3σ_(T) seconds, where σ_(T) is the estimation uncertainty of the receiver clock in seconds. Since Δ_(MIC) is expected to be 1 second and σ_(T) is expected to be around 100 nanoseconds, δ=9.96×10⁻⁵ is used. If the shortest true time interval between MIC interrupts is less than Δ_(MIC)(1−δ), the system redefines the MIC counts for MIC intervals k+p+2 to k+m so that the true time interval between MIC interrupts is as close to Δ_(MIC) as possible and lengthens the k+p+1^(th) MIC interval so that the total length of the Kalman crank is increased by an integer number of seconds so that the length of the crank is mΔ_(MIC)+s seconds.

[0151] The MIC interrupt has been brought into coincidence with UTC boundaries at the true time of the next Kalman crank, this is still the case if an integer number of true seconds are added to the Kalman crank interval. The rate of change of the time bias estimate in the Kalman filter is computed based on the actual time sequence of MIC counts, assuring that the estimate of the time bias will evolve correctly.

[0152] The best estimate of the shortest true time interval resulting from the calculations this far is n_(ƒ)k_(c)/(ƒ₀ ^(ref)(1−{circumflex over (ε)}_(k/k))). The minimum MIC interval constraint will be violated (on q_(ƒ) intervals) if: $\begin{matrix} {\frac{n_{f}k_{c}}{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)} < {\Delta_{MIC}\left( {1 - \delta} \right)}} & (23) \end{matrix}$

[0153] If the foregoing is true, the system redefines the true MIC interval for MIC interrupts k+p+2 to k+m to be as close to the nominal MIC interval as possible:

n(i)=n _(d,nxt) iε[k+p+2, k+m]  (24)

[0154] where $n_{d,{nxt}} = {{round}\left\{ \frac{\Delta_{MIC}{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}}{k_{c}} \right\}}$

[0155] The foregoing is the value for the default MIC count that is used for the next Kalman crank interval.

[0156] Next, the counts for the k+p+1^(th) interval are defined so that the whole Kalman crank interval is lengthened by s seconds, according to the estimates of the clock parameters. A lengthening of s seconds means that instead of steering the clock bias to zero, the count is selected for this new interval so that the clock bias T(t_(k+m)) is as close to −s as possible. n(k+p+1) is selected from the integers to minimize: $\begin{matrix} {{{{T\left( t_{k + m} \right)} + s}} = {{{m \cdot \Delta_{MIC}} + {T\left( t_{k} \right)} - {\left\lbrack {{pn}_{d} + {\sum\limits_{i = {k + p + 1}}^{k + m}{n(i)}}} \right\rbrack \frac{k_{c}}{f_{0}^{ref}\left( {1 - {ɛ\left( t_{k} \right)}} \right)}} + s}}} \\ {= {{A + s - {B{\sum\limits_{i = {k + p + 1}}^{k + m}{n(i)}}}}}} \\ {= {{A + s - {B\left\lbrack {{n\left( {k + p + 1} \right)} + {\left( {q - 1} \right)n_{d,{nxt}}}} \right\rbrack}}}} \\ {= {{A^{\prime} - {{Bn}\left( {k + p + 1} \right)}}}} \end{matrix}$

[0157] where A and B are as defined in equation (18) and A′=A+s−B(q−1)n_(d,nxt). The optimal integer value for n(k+p+1) is then: $\begin{matrix} {{n\left( {k + p + 1} \right)} = {{round}\quad \left\{ {A^{\prime}/B} \right\}}} \\ {= {{round}\left\{ \frac{A + s - {{B\left( {q - 1} \right)}n_{d,{nxt}}}}{B} \right\}}} \\ {= {{round}\left\{ {\frac{A + s}{B} - {\left( {q - 1} \right)n_{d,{nxt}}}} \right\}}} \\ {= {{round}\left\{ {\frac{{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}\left( {{m \cdot \Delta_{MIC}} + {\hat{T}}_{k/k} + s} \right)}{k_{c}} - {pn}_{d} - {\left( {q - 1} \right)n_{d,{nxt}}}} \right\}}} \\ {= {{{round}\left\{ \frac{{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}\left( {{m \cdot \Delta_{MIC}} + {\hat{T}}_{k/k} + s} \right)}{k_{c}} \right\}} - {pn}_{d} - {\left( {q - 1} \right)n_{d,{nxt}}}}} \end{matrix}$

[0158] The integer s is chosen so that the true-time length of MIC interval (k+p+1) is greater than Δ_(MIC)(1−δ). This is accomplished by setting Δ_(τ) _(k+p+1) >Δ_(MIC)(1−δ) or: $\begin{matrix} {{n\left( {k + p + 1} \right)} > {{\Delta_{MIC}\left( {1 - \delta} \right)}\frac{f_{0}\left( {1 - ɛ_{k}} \right)}{k_{c}}}} & (25) \end{matrix}$

[0159] Since round(x)>x−½ for x>0: n(k+p+1)>n′(s) where: ${n^{\prime}(s)} = {\frac{{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}\left( {{m \cdot \Delta_{MIC}} + {\hat{T}}_{k/k} + s} \right)}{k_{c}} - {pn}_{d} - {\left( {q - 1} \right)n_{d,{nxt}}} - \frac{1}{2}}$

[0160] If the magnitude of the oscillator fractional frequency error is bounded by |ε_(k)|<β, s is selected so that $\begin{matrix} {{{n\left( {k + p + 1} \right)} > {n^{\prime}(s)} > {{\Delta_{MIC}\left( {1 - \delta} \right)}\frac{f_{0}^{ref}\left( {1 + \beta} \right)}{k_{c}}} > {{\Delta_{MIC}\left( {1 - \delta} \right)}\frac{f_{0}^{ref}\left( {1 - ɛ_{k}} \right)}{k_{c}}}}{or}{s > {{\frac{k_{c}}{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}\left\lbrack {{{\Delta_{MIC}\left( {1 - \delta} \right)}\frac{f_{0}^{ref}\left( {1 + \beta} \right)}{k_{c}}} + \frac{1}{2} + {\left( {q - 1} \right)n_{d,{nxt}}} + {pn}_{d}} \right\rbrack} - {m \cdot \Delta_{MIC}} - {\hat{T}}_{k/k}}}{so}{s = {{ceil}\left\{ {\frac{k_{c}}{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}\begin{bmatrix} {{{\Delta_{MIC}\left( {1 - \delta} \right)}\frac{f_{0}^{ref}\left( {1 + \beta} \right)}{k_{c}}} + \frac{1}{2} +} \\ {{\left( {q - 1} \right)n_{d,{nxt}}} + {pn}_{d} - {m \cdot \Delta_{MIC}} - {\hat{T}}_{k/k}} \end{bmatrix}} \right\}}}} & (26) \end{matrix}$

[0161] The upper bound for s is defined by: $\begin{matrix} {{s < {{ceil}\left\{ {{\frac{k_{c}}{f_{0}^{ref}\left( {1 - \beta} \right)}\left\lbrack {{\Delta_{MIC}\frac{f_{0}^{ref}\left( {1 + \beta} \right)}{k_{c}}\left( {\left( {1 - \delta} \right) + \left( {q - 1} \right) + p} \right)} + \frac{1}{2}} \right\rbrack} - {m \cdot \Delta_{MIC}} - {\hat{T}}_{k/k}} \right\}}}} \\ {{= {{ceil}\left\{ {\left\lbrack {{\Delta_{MIC}\frac{\left( {1 + \delta} \right)}{\left( {1 - \delta} \right)}\left( {m - \delta} \right)} + \frac{k_{c}}{2{f_{0}^{ref}\left( {2 - \delta} \right)}}} \right\rbrack - {m \cdot \Delta_{MIC}} - {\hat{T}}_{k/k}} \right\}}}} \\ {{< {{ceil}\left\{ {{\frac{m}{1 - \beta}\left( {{2\beta \quad \Delta_{MIC}} + \frac{k_{c}}{2\quad f_{0}^{ref}}} \right)} - {\hat{T}}_{k/k}} \right\}}}} \end{matrix}$

[0162] Now |{circumflex over (T)}_(k/k)|≦½ since the whole value part of the clock bias is absorbed in t_(int) (see equation 15), so s≦1 if: ${\frac{m}{1 - \beta}\left( {{2\quad \beta \quad \Delta_{MIC}} + \frac{k_{c}}{2f_{0}^{ref}}} \right)} < \frac{1}{2}$

[0163] This implies $\beta < \frac{f_{0}^{ref} - {mk}_{c}}{\left( {{4m\quad \Delta_{MIC}} + 1} \right)f_{0}^{ref}}$

[0164] With default values of m=180, Δ_(MIC)=1 and ƒ₀ ^(ref)=10⁶; β<1.3867×10⁻³ guarantees s≦1. This is a very loose requirement for the oscillator fractional frequency error (and its estimate) since the expected flight oscillator will be bounded by 30 ppm.

[0165] The the following equations are used for calculation of the MIC interval counts for a Kalman crank interval. The default control used for the first p interval is: $\begin{matrix} {{n_{d} = {{round}\left\{ {\Delta_{MIC} \cdot {{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}/k_{c}}} \right\}}}\quad {then}} & (27) \\ \begin{matrix} {A = {{m \cdot \Delta_{MIC}} + {\hat{T}}_{k/k} - {{pn}_{d}\left( \frac{k_{c}}{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)} \right)}}} \\ {B = \frac{k_{c}}{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}} \end{matrix} & (28) \end{matrix}$

 S*=round(A/B)

n _(ƒ)=floor(S*/q)

[0166] and

n _(c) =n _(ƒ)+1  (29)

[0167] If the minimum MIC constraint is satisfied (as it is in steady-state operation), i.e.: $\begin{matrix} {\frac{n_{f}k_{c}}{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)} \geq {\Delta_{MIC}\left( {1 - \delta} \right)}} & (30) \end{matrix}$

[0168] using the baseline rules: $\begin{matrix} {{n(i)} = \left\{ \begin{matrix} n_{d} & {i\quad \in \left\{ {{k + 1},\ldots,{k + p}} \right\}} \\ n_{f} & {i\quad \in \left\{ {{k + p + 1},\ldots,{k + p + q_{f}}} \right\}} \\ n_{c} & {i\quad \in \left\{ {{k + p + q_{f} + 1},\ldots,{k + p + m}} \right\}} \end{matrix} \right.} & (31) \end{matrix}$

[0169] where q_(ƒ)=q(n_(ƒ)+1)−S*. If the minimum MIC interval constraint is violated, the following is calculated: $\begin{matrix} \begin{matrix} {n_{d,{nxt}} = {{round}\left\{ \frac{\Delta_{MIC}{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}}{k_{c}} \right\}}} \\ {s = {{ceil}\left\{ {\frac{k_{c}}{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}\begin{bmatrix} {{{\Delta_{MIC}\left( {1 - \delta} \right)}\frac{f_{0}^{ref}\left( {1 + \beta} \right)}{k_{c}}} + \frac{1}{2} +} \\ {{\left( {q - 1} \right)n_{d,{nxt}}} + {pn}_{d} - {m \cdot \Delta_{MIC}} - {\hat{T}}_{k/k}} \end{bmatrix}} \right\}}} \end{matrix} & (32) \end{matrix}$

 A′=A+s−B(q−1)n _(d,nxt)

[0170] using the rule: $\begin{matrix} {{n(i)} = \left\{ \begin{matrix} n_{b} & {i\quad \in \left\{ {{k + 1},\ldots,{k + p}} \right\}} \\ {{round}\left\{ {A^{\prime}/B} \right\}} & {i \in \left\{ {k + p + 1} \right\}} \\ n_{n,{nxt}} & {i\quad \in \left\{ {{k + p + 2},\ldots,{k + p + m}} \right\}} \end{matrix} \right.} & (33) \end{matrix}$

[0171] The average rate of change of the time bias over the Kalman update interval is: ${\overset{\_}{u}}_{k} = \frac{{\hat{T}}_{k + {m/k}} - {\hat{T}}_{k/k}}{m \cdot \Delta_{MIC}}$

[0172] Which is manipulated to: $\begin{matrix} {{\frac{f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}{k_{c}}\left( {{m \cdot \Delta_{MIC}} - {\hat{T}}_{k + {m/k}} + {\hat{T}}_{k/k}} \right){\sum\limits_{i = {k + 1}}^{k + m}{n(i)}}}\quad {{{to}\quad {{obtain}:{\overset{\_}{u}}_{k}}} = {1 - \frac{{k_{c}{\sum\limits_{i = {k + 1}}^{k + m}{n(i)}}}\quad}{m \cdot \Delta_{MIC} \cdot {f_{0}^{ref}\left( {1 - {\hat{ɛ}}_{k/k}} \right)}}}}} & (34) \end{matrix}$

[0173] This is the (constant) deterministic control value that is applied across the receiver time interval [t,t_(k+m)] when propagating the estimate of receiver time bias in equation (12).

[0174] To illustrate the operation of the MIC slew control, consider first a case in which the MIC interval is 1 second, the Kalman crank interval is 4 seconds, and the delay in implementing the MIC slew is 1 second (p=1). Assume that the time bias estimated after the 64th MIC interrupt is 1.4 seconds, that there is no frequency error, and that the time bias is perfectly estimated. This scenario is illustrated in FIG. 15 where the data is identified with o's (the “o” data):

[0175] After the rounded time bias is removed using equation (15), the time bias drops immediately to 0.4 seconds. This corresponds to point M64+. Note that the time bias is the difference between the “o” data and the slope 1 line. Following this, there is a period of one second in which the default MIC interval count (n_(d)) is used. The MIC slew control then removes the remaining 0.4 seconds of time bias by calculating a MIC interval count profile from equations (28) and (31). (The quantization effects are ignored in this example since they will not show up on a plot.) Since the time bias is positive, the unquantized MIC interval count is greater than its default value and the true time between MIC interrupts is lengthened so that the minimum length constraint is not active.

[0176] Next consider the case where the time bias estimated after the 64th MIC is −0.4 seconds. The true time between MIC interrupts resulting from using equation (31) would be lengthened by 0.4/3 seconds. Therefore the minimum length constraint becomes active and the true time in the Kalman crank is increased by one second. The MIC is then aligned with the UTC time tics in the interval between MIC interrupts 65 and 66. During this alignment, the true time interval between MIC interrupts is increased to 1.6 seconds. Note that in this example also, there is a period after the 64th MIC in which the default MIC interval count is used.. At the next Kalman crank time (the 68th MIC interval) the MIC interrupt is aligned with the UTC tic, but the time bias is now +1 second. Since equation (34) was used to propagate the filter estimate of the time bias, the Kalman filter “knows” this. When equation (15) is again invoked, the time bias is reset to zero (point M68+).

[0177] Dual-Processor Subsystems

[0178] The GNS software executes on two processors, a tracking processor and a navigation processor. In the preferred embodiment, two Mongoose V, Synova, Inc. processors are used. They run on an adaptation of the 32-bit MIPS processor architecture. Like the GTA, the processors are implemented on a rad-hard HR2300 series gate array from Honeywell. FIG. 16 is a functional block diagram of the dual processor and FIG. 17 is a simplified layout of the hardware. Both processor hardware configurations are nearly identical with the exception that the navigation processor has a command and telemetry interface with the spacecraft and the tracking processor has a control and data interface to the GTA. In addition, the tracking processor has no nonvolatile memory and thus is slaved to the navigation processor, which is responsible for booting it up after a reset and continually monitoring its health.

[0179] The navigation processor communicates with the spacecraft via a memory-mapped, 8-Kbyte, dual-port RAM (DPRAM), which interfaces to PCI hardware on the spacecraft side of the DPRAM. The “sharing” of the DPIAN between the GNS and the spacecraft is arbitrated by the GSE by use of interrupts and defined access timing constraints. The navigation and tracking processors communicate with each other via another memory-mapped 8-Kbyte DPRAM and, like wise, arbitrate their access with the use of interrupts and defined timing constraints. While the navigation processor has read/write access to this entire DPRAM, the tracking processor has read/write access to the upper 4 Kbytes but only read access to the lower 4 Kbytes. This “read-only” memory provides a “pseudo-non-volatile memory” for the tracking processor, which is utilized during boot-up. The tracking processor communicates with the GTA via a custom address and data bus used for sending control and configuration information and receiving data and status. The software executes an extended Kalman filter which is presented by way of a mathematical model immediately after the following functional descriptions of the software and its tasks.

[0180] GNS Software

[0181] The GNS software is presented as a functional block diagram in FIG. 16. It is partitioned between the tracking processor and navigation processor based on functional requirements, system topology, and required and available processor throughput. The navigation processor utilizes an embedded Operating System (OS) such as the Nucleus Plus produced by Accelerated Technologies, but only in a limited manner i.e., limited to task switching, interrupt handling, and minimal use of events and semaphores. The tracking processor does not make use of an OS due to unacceptable interrupt latencies on its high-rate interrupt (˜667 sec). All navigation and tracking processor software is written in ANSI C, except for a minimal amount of modularized assembly code.

[0182] Tracking Processor Software

[0183] The major tasks performed by the GNS tracking software are listed in Table 7. This software, in conjunction with the GTA, can acquire and track up to 12 space vehicles (SVs). The software supports aided-search and sky-search acquisition modes for acquiring satellites on a channel-by-channel basis. In aided-search, aids generated by the navigation processor are used to determine the SV pseudo-random noise (PRN) and the Doppler range searched out for potential acquisition. In sky-search, no aids are provided and the system searches a wide Doppler range for SV PRNs from a predetermined set. For each signal acquired, the software uses a third-order, phase-locked loop to track the carrier, and an aided first-order, delay-locked loop to track the CA code. A signal monitor is used to determine when a channel drops lock. When this occurs, the processor autonomously tries to reacquire the satellite with a short search. If this fails, the channel switches to the sky-search acquisition mode or if aided by the NP, to the aided acquisition mode.

[0184] The software makes carrier and pseudo-range measurements every second for each satellite in track, and outputs these data to the navigation processor. In addition, the software builds GNS message subframes, validates them using the message parity bits, and then out puts validated subframes to the navigation processor. Interrupts generated by the GTA control the sampling and processing of the data from the 2 tracking channels on the GTA. A measurement signal generated by the GTA is used to control processing and handling of the pseudo-range and carrier phase data, and subsequent output to the navigation processor. TABLE 7 Major GNS Tracking Software Tasks Accept and apply acquisition aids Execute sky-search algorithm in absence of aids Control the GTA Track up to 12 SVs simultaneously Generate validated GPS message subframes Determine SV transmit time for latched data Execute commands from the navigation processor

[0185] Navigation Processor Software

[0186] Table 8 details the major tasks performed by the navigation processor. The core of the navigation processor software is the Kalman filter task, which consists of two main parts: the Extended Kalman Filter (EKF) and the Short-Term Propagator (STP). The Kalman filter updates the state vector and covariance at 180-second intervals and the STP generates all of the data products and outputs them at 1-second intervals. TABLE 8 Major GNS Navigation Software Tasks Process 1 CCSDS telecommand packet per second Output 6 CCSDS telemetry packets per second Output unpacketized data to guidance and control instruments every second Generate a pseudo-range table Build OPS message data stores Execute Kalman filter crank every 180 seconds Output a PVTSE data set once per second; (PVTSE = Position, velocity, time, Sun vector events) Generate acquisition aids Generate control for steering 1 PPS signal Generate and output long-term propagation data

[0187] The GNS uses a Fault Detection and Exclusion (FOB) RAIM technique. The software excludes measurements from the GSE whose residuals exceed a defined threshold via the Kalman filter. The GNS uses a current-state EKF to obtain the current best estimate of the position and velocity of the TIMED satellite center of mass. The EKF is essentially a simulation corrected by periodic measurement updates. The updates normally occur every 180 seconds and process GNS range and phase measurements for up to 12 satellites in track. The state propagation in the EKF contains a Jacchia upper atmospheric density model and a gravity model using degree and order 15 spherical harmonics from the EGM96 database.

[0188] The EKF uses a state space containing 45 states, defined in Table 9, to model the measurements. The drag error state normally represents the error in the drag model, which is dominated by the unpredictability of the upper atmospheric density. If the parameters for the density model are unavailable, the drag error state can be used to model the whole drag effect. TABLE 9 The GNS EKF State Space Parameter Number of States: Position 3 Velocity 3 Drag Parameter Error 1 Clock Error 1 Frequency Error 1 Selective Availability Markov Process 24 Integrated Carrier Phase Bias 12 Total 45

[0189] The prediction capability of the EKF is primarily determined by how rapidly the atmospheric density fluctuates in reaction to solar activity, which will be at a maximum during the TIMED mission.

[0190] The clock and frequency error states are used within a control system that drives the STA's measurement clock and 1 PPS output to be coincident with UTC epochs. This latching signal is also used to define the time of validity of the output data products.

[0191] A two-state damped harmonic oscillator driven by process noise models the selective availability errors for each SV link. The integrated carrier phase bias is used to model the integer ambiguity associated with the phase tracking process. These selective availability (SA) Markov and carrier phase biases are reinitialized when new satellites are brought into track or during reacquisition after a tracking loss of lock.

[0192] After each measurement update, the Kalman filter state is propagated for 180 seconds to the next (anticipated) update time. After this, the STP propagates the state for two more 180-second intervals. These additional propagations are used only for generating real time GNS output data products for the spacecraft (position, velocity, time, Sun vector, event notification flags, and data validity flags) and do not affect the Kalman filter solution. A 5th degree Hermite interpolating polynomial is fit to the three points position and three velocity points forming the boundaries of the two additional propagations. The interpolating polynomial matches position and velocity at the boundary points and is used to interpolate position and velocity to one second intervals. The interpolated position and velocity are used to generate the five event notification flags: 1) primary ground station contact, 2) backup ground station contact, 3) SAA encounter, 4) polar region and 5) day/night at sub-satellite point (used for signaling a terminator crossing).

[0193] Approximately every 12 hours, a long-term propagation (LTP) is executed in order to predict the primary and backup ground station contacts, and the SAA encounters for the next 60 hours. The duration of the propagation is limited by the required accuracy of the data, which is largely dependent on the uncertainty of the atmospheric density at solar max. During the LTP, a state vector corresponding to each predicted ground station contact is saved and used to generate an orbital element set for the respective contact. All of the LTP data products are used solely on the ground (i.e., not utilized onboard) by the MOC and the instrument Payload Operations Centers (POC).

[0194] Extended Kalman Filter

[0195] The TIMED system thus far described is realized through the application of an extended Kalman filter. The filter distills information accumulated from received GPS signals into current state estimates. This is accomplished by propagation and measurement equations which involve nonlinear transformations of the state. A mathematical model defining the processes of the program implementation of the extended Kalman filter is presented immediately after the following graphic description of the filter.

[0196] The time update of the Kalman filter state contains models for the earth's gravity field and for drag. However, since the drag model is uncertain, an error state is included in the state space. Small errors induced by these and other sources are eliminated by a linearization process wherein small errors in the state are estimated and added to the whole value state.

[0197] The filter processes both pseudo-range and carrier phase measurements. The pseudo-range measurements offer a noisy (3-5 m with CA code) measurement of slant range from the TIMED satellite to each GPS satellite. The carrier phase measurements provide precise measurements of line-of-sight velocity which is fully exploited only when the selective availability mode is off.

[0198] The Kalman filter state space is divided into two partitions which are dynamically uncoupled. The first partition includes the states which directly determine the satellite position and time, i.e., position, velocity, drag parameter error, receiver clock and frequency bias. These states evolve according to nonlinear dynamics. The influence of the receiver position on the measurements is also a nonlinear transformation.

[0199] The filter estimates current position and velocity in the conventional inertial system (J2000). The position and velocity change as a result of gravitational acceleration (as provided by a 15×15 spherical harmonic model) and the drag acceleration (provided by the U.S. Space Command high altitude atmosphere model). Any errors in the drag model are absorbed by the drag error state.

[0200] The effects of the imperfect receiver clock are modeled by the time bias and clock frequency error which have been defined in the Receiver Timing section of this patent specification. The time rate of change of the receiver clock is the receiver frequency error.

[0201] The second partition of the state space contains states which do not directly affect TIMED position and time. They are used to model errors in the GPS measurements. These states evolve according to linear dynamics and their influence on the measurements is also linear.

[0202] These selective availability states are a set of second-order Markov processes, one for each link, which model the effect of selective availability on the pseudo-range and carrier phase measurements. A second order process is used with an undamped natural frequency of 300 seconds, damping ratio of 0.4, and a steady state standard deviation of 75 m. When a GPS track is initiated, the selective availability state standard deviation is initialized with the steady state standard deviation.

[0203] The carrier phase bias states model the unknown cycle ambiguity in the phase-derived range. The carrier phase bias state standard deviation is initialized at 1.e9 when a new track is initiated, or when loss of phase-lock is detected.

[0204] The Kalman filter can be initialized in one of three ways: 1) The normal mode of initialization through pre-loaded orbital insertion data. The separation position and velocity in an ECEF coordinate system are loaded by command prior to launch. When the separation event is detected, the Kalman filter transforms the initial conditions to J2000, initialize its state and covariance, resets the crank interval counter, and begins cycling. 2) through a GPS doublet. In this mode, the GPS point solutions are used to establish the initial position, velocity and associated covariance. This process assumes that the point solutions are close enough in time that the TIMED velocity can be regarded as constant. The Kalman filter uses the GPS doublet to reinitialize this state if it detects that its state vector is inconsistent with a large number of GPS measurements. 3) through a commanded upload. In this mode a NORAD two line element set (compatible with the SGP4 orbit propagator) is transformed to a J2000 state vector and covariance by the ground system. This mode is intended for unusual cases in which the GPS cannot function.

[0205] The filter time update propagates the state and covariance between measurements. The filter time update is done immediately after the measurement update so that the MIC corrections can be spread evenly across a Kalman crank interval. This requires that the Kalman filter measurement updates be evenly spaced.

[0206] Every 180 seconds, difference measurements are formed on the basis tracker and GTA data latched at the corresponding MIC. The difference measurements are the pseudo-range and carrier phase minus their predicted values. At this time, measurement sensitivity is calculated. The filter state and covariance are updated by the measurement update process. The Kalman filter residuals are monitored to verify that there are no huge discrepancies between the Kalman filter state and the measurements. If there are, the filter is reinitialized using the GPS doublet. After the measurement update, the GNS output products are generated and a check is made to determine whether the long-term propagation should begin.

[0207] The independent variable in this state propagation is receiver time. An increment of receiver time differs from an increment of true time because of the receiver oscillator frequency error. The position, velocity, drag, clock and fractional frequency error states (the dynamic states) are coupled dynamically to each other by a system of nonlinear ordinary differential equations, the derivations of which commences with equation (35). A transition matrix that propagates small errors in these states is generated using the gradient of the dynamic state derivative with respect to the dynamic state. This discrete time process noise matrix for the dynamic states is also found by integrating its o.d.e. which involves the same gradient.

[0208] The system of nonlinear ordinary differential equations describing the state dynamics is solved by using an 8^(th) order Runge-Kutta Fehlberg algorithm. The performance of the filter begins to degrade because of measurement thinning if the step size is increased beyond 180 seconds. Because propagation is from measurement to measurement, a fixed-step size version of the algorithm is used. The RFK8 algorithm requires 12 function evaluations per step. The subroutine that implements the algorithm integrates vector (not matrix) differential equations. Therefore, the discrete time process noise matrix must be remapped into a vector as well as its derivative.

[0209] The selective availability (SA) states and the phase biases (the “sat” states) obey linear dynamics. The separation between measurements is constant, allowing the continuous part of the transition matrix and discrete time process noise to be precomputed. The “sat” states are ordered according to tracker channel. The transition matrix (and the discrete time process noise matrix for the “sat” states) model the effects of a new GPS satellite in a given tracking channel.

[0210] A full state (“dyn”+“sat”) transition matrix is formed from the block-diagonal concatenation of the “dyn” and “sat” transition matrices. The “dyn” partition is computed by solving an o.d.e. containing the “dyn” state derivative gradient. The covariance factor is updated for deterministic effects by premultiplying it by the full state transition matrix using a sparse matrix multiply routine. To accomplish the stochastic update of the covariance factor, a vertical concatenation of the deterministically updated covariance factor and the full-state discrete time process noise factor is formed. This array is then decomposed into an orthogonal matrix and upper triangular matrix using a sparse QR decomposition algorithm. The updated covariance factor (transpose) is found in the upper part of the upper triangular matrix.

[0211] The raw pseudo-range and carrier phase measurements are formed from the following quantities: 1) fractional chip count (pass-through from GTA); 2) chips into epoch (pass-through from GTA); 3) epochs into bit (from tracking SW bit sync process); 4) high order bits of Z-count or TOW (Time Of Week) (from message); 5) GPS week (from message); 6) whole cycle count; 7) fractional cycle count; and 8) receiver time.

[0212] Predicted pseudo-range and carrier phase for each satellite in track is then calculated from the receiver position, the SA and phase bias states of the GPS message ephemeris. Since the predicted pseudo-range is a function of the satellite position at the predicted transmit time (which in turn depends on the predicted pseudo-range) this process is iterative. The Kalman filter processes the difference between the raw measurements and their predicted values. The measurement sensitivity depends on the unit vectors from the TIMED satellite to the GPS satellites in track. They are produced in the calculation of predicted pseudo-range.

[0213] In the Levy square root covariance Kalman filter derivations, the array on the left of equation (67) is formed from the measurement noise factor, the time-updated covariance factor, and the measurement. This array is factored into an orthogonal matrix and an upper triangular matrix containing the measurement update covariance factor, and the W matrix which is used to compute the Kalman gain.

[0214] After every measurement update, the filter launches a low precision state propagation to fill a table containing position, velocity, sun-vector, event notifications, and time for the next 180+ seconds. In this mode the orbit propagator may only use the J2 part of the gravity module to improve execution speed.. The event notifications are: 1) entry into the South Atlantic Anomaly (SAA) or Polar regions, 2) ground contacts and 3) terminator crossings.

[0215] Every 12 hours, the Kalman filter launches a high precision orbit propagation using its last computed state vector. This trajectory is monitored for contact events and any SAA entry. When a contact event is found, the trajectory points near the AOS are used to define an element set appropriate for used in the NORAD SGP4 algorithm. After every measurement update, the Kalman filter produces acquisition aides for the tracking software. The aids contain Doppler and Doppler rate for all GPS satellites based on the current TIMED state vector and current almanac ephemeris.

[0216] To avoid missing an event because of the granularity of the propagated orbit, the event detection and prediction is based on polynomials fit to functions of the propagated points. For the contact events, a polynomial is fit to the elevation of the TIMED satellite as seen by the various ground stations evaluated at the trajectory points. The roots of this polynomial are the AOS (going+) and LOS (going−) times. If AOS−LOS>5 minutes, it is a valid contact. For the South Atlantic Anomaly, a polynomial is fit to the latitude and longitude polynomials of the sub-satellite point. The points at which the latitude and longitude polynomials cross the latitudes and longitudes of the SAA region is calculated. If the satellite is in the SAA latitude band at the same time it is in the longitude band, an SAA event is flagged. The polar region is done in a similar fashion, except only the latitude is used. For the terminator crossings, a curved is fit to the inner product of the sun-vector and the unit normal to the reference episode at the sub-satellite point. The roots of this polynomial define the terminator crossings.

[0217] Kalman Filter Implementation

[0218] The following presentation mathematically describes the processes carried out by the software in implementing the various routines used to accomplish the tasks of the extended Kalman filter which forms the nucleus of the GNS.

[0219] The state space for the TIMED GNS Kalman filter is: $\begin{matrix} {{x(t)} = \begin{bmatrix} {w\left( {\tau (t)} \right)} \\ {\alpha (t)} \\ {T(t)} \\ {ɛ(t)} \\ {{sa}(t)} \\ {b(t)} \end{bmatrix}_{9 + {{3 \cdot n_{\max}} \times 1}}} & (35) \end{matrix}$

[0220] where w(τ(t)) is the position and velocity of the TIMED center of mass (CM) in the conventional inertial system (CIS): ${w\left( {\tau (t)} \right)} \equiv {\begin{bmatrix} {r\left( {\tau (t)} \right)} \\ {v\left( {\tau (t)} \right)} \end{bmatrix}_{6 \times 1}{\left( {{{{TIMED}\quad {inertial}\quad {position}}\quad\&}\quad {velocity}} \right).}}$

[0221] Note that w(τ(t)) is defined as a composite function: w(•) is an explicit function of true time. The evolution of w(•) is governed by Newton's second law, which involves derivatives taken according to true time (not receiver time). The units of w(•) are meters and meters per second. The drag error parameter is defined as the ratio of the true value of the parameter group ρ·C_(D)·A/(2·M) to its nominal value: ${\alpha (t)} \equiv {{\left( \frac{\rho \cdot C_{D} \cdot A}{2 \cdot M} \right) \div \left( \frac{\rho \cdot C_{D} \cdot A}{2 \cdot M} \right)^{nominal}}{\left( {{drag}\quad {parameter}} \right).}}$

[0222] The state α includes the effects of errors in density, drag coefficient, projected area, and satellite mass. The first term on the right is the true parameter group, the second is the parameter group predicted by the density model, with the nominal spacecraft ballistic coefficient, mass, and an average projected area.

[0223] The clock related states T(t) and ε(t) and are defined according to:

T(t)≡t−τ(t) (Clock bias)  (36) $\begin{matrix} {{ɛ(\tau)} \equiv {\frac{f_{0}^{ref} - {f_{0}(\tau)}}{f_{0}^{ref}}{\left( {{Fractional}\quad {frequency}\quad {bias}} \right).}}} & (37) \end{matrix}$

[0224] The effect of selective availability is modeled as a two-state Markov process for each satellite. The vector sa(t) contains two states for each satellite that can be tracked for a total of2n_(max) states:

sa(t)≡[sa ₁(t)sa ₂(t) • • • sa _(2·n) _(max) ⁻¹(t)sa _(2·n) _(max) (t)]^(t).  (38)

[0225] The odd elements of sa(t) represent the effect of SA in meters on the pseudo-range and integrated carrier measurements. The even elements are the (receiver) time derivatives of the odd elements. The vector b(t) is an array of phase derived range biases to account for the arbitrary initialization of the integrated carrier phase measurement:

b(t)≡[b ₁(t)b ₂(t) • • • b _(n) _(max) ⁻¹(t)b _(n) _(max) (t)]^(t) (Phase derived range biases).

[0226] The equations defining the forming and processing of the Kalman filter measurements use the index k to denote times at which a Kalman filter measurement is to be processed, which is every m^(th) MIC interrupt. Previously, k was used to denote the MIC times.

[0227] The pseudo-range measurement begins with the raw data where the GPS signal coming into the TIMED antenna at true time τ is:

s _(R)(τ)=CA(PRN ^(ν) ,t ^(ν)(τ))·m(t ^(ν)(τ))·sin(2π{circumflex over (ƒ)}_(L1) t ^(ν)(τ)−φ_(iono) ^(L1/C1)(τ))  (39)

[0228] where PRN^(ν) is the PRN (pseudo random noise) number of the satellite in tracking channel ν, CA(PRN^(ν), t^(ν)) is the CA (coarse acquisition) code transmission for the satellite as a function of the signal-indicated transmit time t^(ν)(τ), m(t^(ν)(τ)) is the data modulation of the GPS transmission, sin(2π{circumflex over (ƒ)}_(L1)t^(ν)(τ)−φ_(iono) ^(L1/C1)(τ)) is the GPS carrier, {circumflex over (ƒ)}_(L1) is the nominal GPS carrier frequency 1575.42 Mhz, and φ_(iono) ^(L1/C1)(τ) is the phase retardation of the GPS carrier (relative to the code) caused by ionospheric dispersion. This is equal to the difference in the phase and group delays: $\begin{matrix} {{\phi_{iono}^{{L1}/{C1}}(\tau)} = {\frac{2\pi \quad {\hat{f}}_{L1}}{c}\left( {{I_{p}^{v}\left( \tau_{k} \right)} - {I_{g}^{v}\left( \tau_{k} \right)}} \right)}} & (40) \end{matrix}$

[0229] where I_(g) ^(ν)(τ^(k)) is the group delay in seconds and I_(p) ^(ν)(τ_(k)) is the phase delay. The GNS receiver generates a local replica of the GPS CA code, which is synchronized with the received code when the receiver has locked-up:

CA(PRN ^(ν) ,t ^(ν)(τ))=CA(PRN ^(ν) ,t(τ))

[0230] At receiver time t_(k)≡t(τ_(k)), the local code phase is latched, this is the measurement interrupt clock (MIC) event. The value of the transmit time in seconds since the GPS standard epoch in terms of the local code phase and quantities in the GPS message is: $\begin{matrix} \begin{matrix} {t_{k}^{v} = {{t\_ int}_{k}^{v} + {t\_ float}_{k}^{v}}} \\ {{t\_ int}_{k}^{v} = {{{GPS\_ week}_{v} \cdot 86400 \cdot 7} + {{TOW}~ \cdot 6}}} \\ {{t\_ float}_{k}^{v} = \begin{bmatrix} {\frac{{bits\_ n2}{\_ sframe}_{x}}{50} + \frac{{epochs\_ n2}{\_ bit}_{x}}{1000} +} \\ \frac{{{chx\_ cacode}{\_ phase}} + {{chx\_ codenco}{{\_ phase}/2^{16}}}}{1023000} \end{bmatrix}} \end{matrix} & (41) \end{matrix}$

[0231] Here t_(k) ^(ν) is the receiver estimate of the transmit time of that point in the CA code that the local code was correlating with at the k^(th) MIC. It is composed of an integer part and a floating point part which can never exceed 6 seconds. The quantities bits_n2_sframe_(x) and epochs_n2_bit_(x) represent the number of completed bits into the current subframe and the number of completed code epochs into the current bit for tracking channel x. They are maintained by the tracking software after it has achieved bit and frame synchronization. The quantities chx_cacode_phase and chx_codenco_phase are read from the registers on the TIMED GTA chip containing the full chip count and the fractional chip count for tracking channel x. The variable GPS_week (the current GPS week) is initially set by the contents of word 3 of subframe 1 in the GPS message and is incremented by one (and seconds_n2_week is decremented by 7·86400) if seconds_n2_week=TOW·6+T_float_(k) ⁸⁴ exceeds 7·86400. TOW is the number of 6 second counts from the beginning of the week to the beginning of the next subframe, taken from the handover word of the last completely assembled subframe.

[0232] The pseudo-range is then constructed as: $\begin{matrix} \begin{matrix} {\rho_{k}^{v} = {c \cdot \left( {t_{k} - t_{k}^{v}} \right)}} \\ {= {c \cdot \left\lbrack {\left( {t_{k} - {t\_ int}_{k}^{v}} \right) - {t\_ float}_{k}^{v}} \right\rbrack}} \end{matrix} & (42) \end{matrix}$

[0233] where c is the speed of light, and t_(k)=MIC_time_(k)+t_(int) is the (controlled) receiver time corresponding to the MIC. Note that the large integers t_(k) and t_int_(k) ^(ν) are differenced before subtracting the floating point number t_float_(k) ^(ν) so as not to lose precision. The model for the indicated receive time is: t_(k)=τ_(k)+T_(k).

[0234] The signal indicated transmit time is the transmit time derived from the modulation on the GPS signal. The model for the signal-indicated transmit time is: $\begin{matrix} {t_{k}^{v} = {\tau_{k}^{v} + {T^{v}\left( \tau_{k}^{v} \right)} + {\frac{1}{c}{{sa}_{*}^{v}\left( \tau_{k}^{v} \right)}}}} & (43) \end{matrix}$

[0235] The receiver indicated transmit time is the signal indicated transmit time corrupted with receiver tracking errors: $\begin{matrix} {{{\hat{t}}_{k}^{v} \equiv {t_{k}^{v} + {\delta \quad t_{k}^{v}}}}\quad = {\tau_{k}^{v} + {T^{v}\left( \tau_{k}^{v} \right)} + {\frac{1}{c}{{sa}_{*}^{v}\left( \tau_{k}^{v} \right)}} + {\delta \quad t_{k}^{v}}}} & (44) \end{matrix}$

[0236] where t_(k) ^(ν) is the signal-indicated transmit time and δt_(k) ^(ν) is the tracking error: τ_(k) ^(ν)≡τ^(ν)(t_(k)) is the true transmit time of the signal being tracked in channel ν at the k^(th) MIC interrupt, T^(ν)(τ_(k) ^(ν)) is the GPS satellite clock bias, sa_(*) ^(ν)(τ_(k) ^(ν)) is the selective availability process, and the receiver tracking error, δt_(k) ^(ν), is assumed to be white at the MIC interval. The true transmit and receive times are related by: ${\tau_{k} - \tau_{k}^{v}} = {\int_{PATH}\frac{{r}}{v_{g}(r)}}$

[0237] where v_(g)(r) is the group speed of the GPS transmission as a function of position, and where the integration path (PATH) begins at the GPS satellite position at the true transmit time (r_(cis) ^(ν)(τ_(k) ^(ν)), and ends at the position of the receiver antenna at the receive time (r^(ant)(τ_(k))=r(τ_(k))+T_(body) ^(cis)(τ_(k))L_(ant)). Here r(τ_(k)) is the TIMED center of mass position in the CIS system at the true receive time τ_(k), r_(cis) ^(ν)(σ_(k) ^(ν)) is the true position of the GPS satellite in track by channel ν at the transmit time τ_(k) ^(ν), L_(ant) is the CM to antenna phase center lever arm in the TIMED body system, and T_(body) ^(cis)(τ) is the transformation from body to inertial coordinates obtained from the attitude system.

[0238] Assuming: $\frac{1}{v_{g}} = {{\frac{1}{c} \cdot \frac{1}{1 - \left( {1 - {v_{g}/c}} \right)}}\quad \cong {\frac{1}{c}\left\lbrack {1 + \left( {1 - \frac{v_{g}}{c}} \right)} \right\rbrack}}$

[0239] the free space range delay and the ionospheric delay are separable, so that the time difference may be modeled as: $\begin{matrix} {{\tau_{k} - \tau_{k}^{v}} \cong {\int_{PATH}\frac{{r}}{v_{g}(r)}}} \\ {{\cong {{\frac{1}{c}{\int_{PATH}{{r}}}} + {\frac{1}{c}{\int_{PATH}{\left( {1 - \frac{v_{g}(r)}{c}} \right){{r}}}}}}}} \\ {{= {{\frac{1}{c}{{{r^{v}\left( {\tau - {\Delta^{v}(\tau)}} \right)} - {r^{ant}(\tau)}}}} + {\frac{1}{c}{\int_{PATH}{\left( {1 - \frac{v_{g}(r)}{c}} \right){{r}}}}}}}} \\ {{= {{\Delta^{v}\left( \tau_{k} \right)} + {{I_{g}^{v}\left( \tau_{k} \right)}/c}}}} \end{matrix}$

[0240] where Δ^(ν)(τ) is the free-space range delay (in seconds) for the ν^(th) link, and $\begin{matrix} \begin{matrix} {{I_{g}^{v}\left( \tau_{k} \right)} = {\frac{1}{c}{\int_{PATH}{\left( {1 - \frac{v_{g}(r)}{c}} \right){{r}}}}}} \\ {= {\frac{1}{c}{\int_{PATH}{\left( {1 - {n(r)}} \right){{r}}}}}} \end{matrix} & (45) \end{matrix}$

[0241] is the ionospheric range delay (in meters) at the true receive time. Here n(r) is the index of refraction as a function of position. The free space range delay is given implicitly by: $\begin{matrix} {{\Delta^{v}(\tau)} = \left. \frac{1}{c} \middle| {{r^{v}\left( {\tau - {\Delta^{v}(\tau)}} \right)} - \left( {{r(\tau)} + {{T_{body}^{cis}(\tau)}L_{ant}}} \right)} \right|} \\ {= \left. \frac{1}{c} \middle| {{r^{v}\left( {\tau - {\Delta^{v}(\tau)}} \right)} - {r^{ant}(\tau)}} \right|} \end{matrix}$

[0242] where r^(ant)(τ)=r(τ)+T_(body) ^(cis)(τ)L_(ant) is the position of the TIMED GPS antenna. The model for the raw pseudo-range measurement is: $\begin{matrix} \begin{matrix} {\rho_{k}^{v} = {c \cdot \left( {t_{k} - {\hat{t}}_{k}^{v}} \right)}} \\ {{= {c \cdot \left( {\tau_{k} + T_{k} - \tau_{k}^{v} - {T^{v}\left( \tau_{k}^{v} \right)} - {{{sa}_{*}^{v}\left( \tau_{k}^{v} \right)}/c} - {\delta \quad t_{k}^{v}}} \right)}}} \\ {{= {c \cdot \left( {{\Delta^{v}\left( \tau_{k} \right)} + {{I_{g}^{v}\left( \tau_{k} \right)}/c} + T_{k} - {T^{v}\left( \tau_{k}^{v} \right)} - {{{sa}_{*}^{v}\left( \tau_{k}^{v} \right)}/c} - \delta_{k}^{v}} \right)}}} \\ {{\cong {{c \cdot \left( {{\Delta^{v}\left( \tau_{k} \right)} + T_{k} - {T^{v}\left( \tau_{k}^{v} \right)} - {\delta \quad t_{k}^{v}}} \right)} + {I_{g}^{v}\left( \tau_{k} \right)} + {{sa}^{v}\left( \tau_{k} \right)}}}} \end{matrix} & (46) \end{matrix}$

[0243] where a second order markov random process in the range domain keyed on receiver time, sa^(ν)(τ_(k)), is used to model the true selective availability process −sa_(*) ^(ν)(τ_(k) ^(ν)) (note the sign reversal).

[0244] The Kalman filter pseudo-range difference measurement is constructed as the difference between the measured pseudo-range and pseudo-range predicted from all measurements processed up to the previous time:

y _(ρ) ^(ν)(k)≡ρ_(k) ^(ν)−{circumflex over (ρ)}_(k/k−1) ^(ν)  (47)

[0245] The predicted pseudo-range is given by:

{circumflex over (ρ)}_(k/k−1) ^(ν) =c·({circumflex over (Δ)}_(k/k−1) ^(ν) +I _(g,mess) ^(ν)({circumflex over (t)} _(k) ^(ν))/c+{circumflex over (T)} _(k/k−1) −T _(mess) ^(ν)({circumflex over (t)} _(k) ^(ν))+ŝâ ^(ν)(t _(k/k−1)))

[0246] where:

[0247] {circumflex over (Δ)}_(k/k−1) ^(ν)≡estimated free space range delay

[0248] I_(g,mess) ^(ν)({circumflex over (t)}_(k))≡group delay from GPS message

[0249] {circumflex over (T)}_(k/k−1)≡estimated receiver clock bias (controlled) $\begin{matrix} {{T_{mess}^{v}\left( t_{k}^{v} \right)} \equiv {{GPS}\quad {satellite}\quad {clock}\quad {error}\quad {derived}\quad {from}\quad {message}}} \\ {{= {a_{0}^{v} + {a_{1}^{v}\left( {{{siw}\left( {\hat{t}}_{k}^{v} \right)} - t_{0c}} \right)} + {a_{2}^{v}\left( {{{siw}\left( {\hat{t}}_{k}^{v} \right)} - t_{0c}} \right)}^{2}}}} \end{matrix}$

[0250] siw({circumflex over (t)}_(k) ^(ν))≡seconds into GPS week corresponding to {circumflex over (t)}_(k) ^(ν)

[0251] a_(i) ^(ν)≡Clock compensation the params for sat ν (all from current message page)

[0252] t_(0c)≡epoch for clock compensation (seconds into week) $\begin{matrix} {{\hat{s}\quad {{\hat{a}}^{v}\left( t_{{k/k} - 1} \right)}} \equiv {{estimated}\quad {selective}\quad {availability}\quad {markov}\quad ({range})}} \\ {{= {\hat{s}\quad {{\hat{a}}_{{k/k} - 1}^{{2v} - 1}\left( {{See}\quad {equation}\quad (38)} \right)}}}} \end{matrix}$

[0253] The estimated range delay is defined implicitly by: $\begin{matrix} \begin{matrix} \begin{matrix} {0 = \left. {{\hat{\Delta}}_{{k/k} - 1}^{v} - \frac{1}{c}} \middle| {{r^{v}\left( {\tau_{{k/k} - 1} - {\hat{\Delta}}_{{k/k} - 1}^{v}} \right)} - r_{{k/k} - 1}^{ant}} \right.} \\ {{{where}\text{:}\quad {\hat{r}}_{{k/k} - 1}^{ant}} \equiv {{\hat{r}}_{{k/k} - 1} + {{{\hat{T}}_{body}^{cis}\left( t_{k} \right)}{\hat{L}}_{ant}}}} \\ {{\hat{\tau}}_{{k/k} - 1} \equiv {{estimated}\quad {true}\quad {receiver}\quad {time}}} \\ {{= {t_{k} - {\hat{T}}_{{k/k} - 1}}}} \end{matrix} \\ \quad \end{matrix} & (48) \end{matrix}$

r̂_(k/k − 1)^(ant)

[0254] is the estimate of TIMED GPS antenna position in the CIS coordinate system at the receive time and r^(ν)({circumflex over (τ)}_(k/k−1)−{circumflex over (Δ)}_(k/k−1) ^(ν)) is the position of the GPS satellite tracked by channel ν at the estimated transmit time. (The procedure used to solve equation (48) for {circumflex over (Δ)}_(k/k−1) ^(ν) follows.)

[0255] An iteration is used to find the solution to the light-time equation:

0=ξ({circumflex over (Δ)}_(k/k−1) ^(ν))

[0256] where: $\begin{matrix} {{\xi (\Delta)} = \left. {\Delta - \frac{1}{c}} \middle| {{r^{v}\left( {{\hat{\tau}}_{{k/k} - 1} - \Delta} \right)} - {\hat{r}}_{{k/k} - 1}} \right|} \\ {{r^{v}(\tau)} = {{T_{cts}^{cis}(\tau)}{r_{cts}^{v}(\tau)}}} \end{matrix}$

[0257] r_(cts) ^(ν)(τ) is the position of the ν^(th) satellite in the earth-fixed CTS frame calculated from the GPS message ephemeris.

[0258] Using an initial guess for Δ: $\begin{matrix} {{\Delta (0)} = \left. \frac{1}{c} \middle| {{r^{v}\left( {\hat{\tau}}_{{k/k} - 1} \right)} - {\hat{r}}_{{k/k} - 1}} \right|} & (49) \end{matrix}$

[0259] the iteration proceeds as: $\begin{matrix} {{\Delta \left( {j + 1} \right)} = \left. \frac{1}{c} \middle| {{r^{v}\left( {{\hat{\tau}}_{{k/k} - 1} - {\Delta (j)}} \right)} - {\hat{r}}_{{k/k} - 1}} \right|} & (50) \end{matrix}$

[0260] until |Δ(j+1)−Δ(j)|≦tol. Typically, tol=1.e−11 seconds. At convergence set {circumflex over (Δ)}_(k/k−1) ^(ν)=Δ(j).

[0261] In the Kalman filter, the pseudo-range difference measurement is determined by substituting into equation (47): $\begin{matrix} {{y_{\rho}^{v}(k)} = {{c \cdot \left( {{\Delta^{v}\left( \tau_{k} \right)} + T_{k} - {T^{v}\left( \tau_{k}^{v} \right)} - {\delta \quad t_{k}^{v}}} \right)} + {I_{g}^{v}\left( \tau_{k} \right)} + {{sa}^{v}\left( t_{k} \right)} -}} \\ {{{c \cdot \left( {{\hat{\Delta}}_{{k/k} - 1}^{v} + {\hat{T}}_{{k/k} - 1} - {T_{mess}^{v}\left( t_{k}^{v} \right)}} \right)} - {I_{g,\quad {mess}}^{v}\left( t_{k}^{v} \right)} - {\hat{s}{\hat{a}}_{{k/k} - 1}^{{2v} - 1}}}} \\ {= {{c \cdot \left( {{\delta\Delta}_{k}^{v} + {\delta \quad T_{k}}} \right)} + {\delta \quad {sa}_{k}^{{2v} - 1}} + {\delta\rho}_{k}^{v}}} \end{matrix}$

[0262] this assumes that I_(g,mess) ^(ν)(t_(k) ^(ν))=I_(g) ^(ν)(τ_(k)) and T_(mess) ^(ν)(t_(k) ^(ν))=T^(ν)(τ_(k) ^(ν)) (no errors in the ionospheric compensation or GPS clock compensation in the GPS message data). δρ_(k) ^(ν)=c·δt_(k) ^(ν) is a white noise process representing all high frequency delay-locked loop errors, and δΔ_(k) ^(ν)≡Δ^(ν)(τ)−{circumflex over (Δ)}_(k/k−1) ^(ν) is the error in the estimated free space range delay. The solution for δΔ_(k) ^(ν) in terms of the Kalman filter error state follows:

[0263] The errors in position and velocity are synchronous, therefor: $\begin{matrix} \begin{matrix} {{\hat{r}}_{{k/k} - 1} = {{r\left( {\tau \left( t_{k} \right)} \right)} - {\delta \quad r}}} \\ {= {{r\left( \tau_{k} \right)} - {\delta \quad r_{k}}}} \end{matrix} & (51) \end{matrix}$

[0264] Assuming that the attitude system provides an orientation matrix that is a perfect real-time reference and the lever arm is perfect: T̂_(body)^(cis)(t_(k))L̂_(ant) = T_(body)^(cis)(τ_(k))L_(ant)

[0265] so: $\begin{matrix} {{\hat{r}}_{{k/k} - 1}^{ant} = {{\hat{r}}_{{k/k} - 1} + {{T_{body}^{cis}\left( \tau_{k} \right)}L_{ant}}}} \\ {= {{r\left( \tau_{k} \right)} - {\delta \quad r_{k}} + {{T_{body}^{cis}\left( \tau_{k} \right)}L_{ant}}}} \\ {= {{r^{ant}\left( \tau_{k} \right)} - {\delta \quad r_{k}}}} \end{matrix}$

[0266] The true quantity minus the error is substituted for the estimated quantities in equation (48):

[0267] Where: $\begin{matrix} {\left. {0 \cong {{\Delta^{v}\left( \tau_{k} \right)} - {\delta\Delta}_{k}^{v} - \frac{1}{c}}} \middle| {{r^{v}\left( {t_{k} - {\hat{T}}_{{k.k} - 1} - {\Delta^{v}\left( \tau_{k} \right)} + {\delta\Delta}_{k}^{v}} \right)} - {r^{ant}\left( \tau_{k} \right)} + {\delta \quad r_{k}}} \right|\quad} \\ {= \left. {{\Delta^{v}\left( \tau_{k} \right)} - {\delta\Delta}_{k}^{v} - \frac{1}{c}} \middle| {{r^{v}\left( {t_{k} - \left( {T_{k} - {\delta \quad T_{k}}} \right) - {\Delta^{v}\left( \tau_{k} \right)} + {\delta\Delta}_{k}^{v}} \right)} - {r^{ant}\left( \tau_{k} \right)} + {\delta \quad r_{k}}} \right|} \\ {= \left. {{\Delta^{v}\left( \tau_{k} \right)} - {\delta\Delta}_{k}^{v} - \frac{1}{c}} \middle| {{r^{v}\left( {\tau_{k} + {\delta \quad T_{k}} - {\Delta^{v}\left( \tau_{k} \right)} + {\delta\Delta}_{k}^{v}} \right)} - {r^{ant}\left( \tau_{k} \right)} + {\delta \quad r_{k}}} \right|} \\ \left. {\cong {{\Delta^{v}\left( \tau_{k} \right)} - {\delta\Delta}_{k}^{v} - \frac{1}{c}}} \middle| {{r^{v}\left( {\tau_{k} - {\Delta^{v}(\tau)}} \right)} + {{\overset{\cdot v}{r}\left( {\tau_{k} - {\Delta^{v}\left( \tau_{k} \right)}} \right)} \cdot \left( {{\delta \quad T_{k}} + {\delta\Delta}_{k}^{v}} \right)} - {r^{ant}\left( \tau_{k} \right)} + {\delta \quad r_{k}}} \right| \\ \left. {\cong {{\Delta^{v}(\tau)} - \frac{1}{c}}} \middle| {{r^{v}\left( {\tau_{k} - {\Delta^{v}\left( \tau_{k} \right)}} \right)} - {r^{ant}\left( \tau_{k} \right)}} \middle| {{- {\delta\Delta}_{k}^{v}} - {\frac{{\hat{ɛ}}_{k}^{v}}{c} \cdot \left\lbrack {{{\hat{v}}^{v}\left( {{\delta \quad T_{k}} + {\delta\Delta}_{k}^{v}} \right)} + {\delta \quad r_{k}}} \right\rbrack}} \right. \end{matrix}$ ${Where}:\quad \begin{matrix} {{\hat{e}}_{k}^{v} = \frac{{r^{v}\left( {{\hat{\tau}}_{{k/k} - 1} - {\hat{\Delta}}_{{k/k} - 1}^{v}} \right)} - {\hat{r}}_{{k/k} - 1}^{ant}}{\left| {{r^{v}\left( {{\hat{\tau}}_{{k/k} - 1} - {\hat{\Delta}}_{{k/k} - 1}^{v}} \right)} - {\hat{r}}_{{k/k} - 1}^{ant}} \right|}} \\ {{\hat{v}}^{v} = {{\overset{\cdot v}{r}\left( {t_{k} - {\hat{T}}_{{k/k} - 1} - {\hat{\Delta}}_{{k/k} - 1}^{v}} \right)}\quad {\left( {{from}\quad {GPS}\quad {ephemeris}} \right).}}} \\ {\left. {{{But}\quad {\Delta^{v}(\tau)}} - \frac{1}{c}} \middle| {{r^{v}\left( {\tau_{k} - {\Delta^{v}\left( \tau_{k} \right)}} \right)} - {r^{ant}\left( \tau_{k} \right)}} \right| = {0,\quad {so}}} \end{matrix}$ $0 = {{\delta\Delta}_{k}^{v} - {\frac{{\hat{e}}_{k}^{v}}{c} \cdot \left\lbrack {{{\hat{v}}^{v} \cdot \left( {{\delta \quad T_{k}} + {\delta\Delta}_{k}^{v}} \right)} + {\delta \quad r_{k}}} \right\rbrack}}$

[0268] Solving for δΔ_(k) ^(ν) yields: $\begin{matrix} {\begin{matrix} {{\delta\Delta}_{k}^{v} = {- \frac{\left( {\hat{e}}_{k}^{v} \right)^{t}\left\lbrack {{\delta \quad r_{k}} + {{\hat{v}}^{v} \cdot \left. \left( {{\delta \quad T_{k}} + {{\delta\Delta}\quad T_{k}}} \right. \right\rbrack}} \right.}{c + {\left( {\hat{e}}_{k}^{v} \right)^{t}{\hat{v}}^{v}}}}} \\ {= {{\left\lbrack \frac{\partial\Delta^{v}}{\partial T} \right\rbrack_{k}\delta \quad T_{k}} + {\left\lbrack \frac{\partial\Delta^{v}}{\partial r} \right\rbrack_{k}\delta \quad r_{k}}}} \end{matrix}{{where}:}} & (52) \\ {{\left\lbrack \frac{\partial\Delta^{v}}{\partial T} \right\rbrack_{k} \equiv {- \frac{\left( {\hat{e}}_{k}^{v} \right)^{t}{\hat{v}}^{v}}{c + {\left( {\hat{e}}_{k}^{v} \right)^{t}{\hat{v}}^{v}}}}}} & (53) \\ {\left\lbrack \frac{\partial\Delta^{v}}{\partial r} \right\rbrack_{k} \equiv {- \frac{\left( {\hat{e}}_{k}^{v} \right)^{t}}{c + {\left( {\hat{e}}_{k}^{v} \right)^{t}{\hat{v}}^{v}}}}} & (54) \end{matrix}$

[0269] The measurement model for the pseudo-range observable is then: $\begin{matrix} {{y_{\rho}^{v}(k)} = {{c \cdot \left( {{\left\{ {\left\lbrack \frac{\partial\Delta^{v}}{\partial T} \right\rbrack_{k} + 1} \right\} \delta \quad T_{k}} + {\left\lbrack \frac{\partial\Delta^{v}}{\partial r} \right\rbrack_{k}\delta \quad r_{k}}} \right)} + {\delta \quad {sa}_{k}^{{2v} - 1}} + {\delta\rho}_{k}^{v}}} & (55) \end{matrix}$

[0270] leading to the concatenated measurement model: $\begin{matrix} {{y_{\rho}(k)} = {{{\left\lbrack {H_{w}\quad 0\quad H_{T}\quad 0\quad H_{sa}\quad 0} \right\rbrack \begin{bmatrix} {\delta \quad w} \\ {\delta \quad a} \\ {\delta \quad T} \\ {\delta ɛ} \\ {\delta \quad {sa}} \\ {\delta \quad b} \end{bmatrix}}_{k} + {\delta\rho}_{k}}\quad  = {{{H_{\rho} \cdot \delta}\quad {x\left( t_{k} \right)}} + {\delta\rho}_{k}}}} & (56) \end{matrix}$

[0271] where δρ_(k) is modeled as white Gaussian noise with (δρ)=diag(σ_(ρ,k) ²) and where the measurement sensitivity partitions are: $\begin{matrix} {H_{w} = {c \cdot \begin{bmatrix} \left\lbrack \frac{\partial\Delta^{1}}{\partial r} \right\rbrack_{k} & 0 \\ \left\lbrack \frac{\partial\Delta^{2}}{\partial r} \right\rbrack_{k} & 0 \\  \cdot & \cdot \\  \cdot & \cdot \\ \left\lbrack \frac{\partial\Delta^{n_{\max}}}{\partial r} \right\rbrack_{k} & 0 \end{bmatrix}}} & (57) \end{matrix}$

[0272] [∂Δ^(ν)/∂r]_(k) as defined in equation (54) $\begin{matrix} {H_{T} = {c \cdot \begin{bmatrix} {\left\lbrack \frac{\partial\Delta^{1}}{\partial T} \right\rbrack_{k} + 1} \\ {\left\lbrack \frac{\partial\Delta^{2}}{\partial T} \right\rbrack_{k} + 1} \\ \vdots \\ {{\left\lbrack \frac{\partial\Delta^{n_{\max}}}{\partial T} \right\rbrack_{k} + 1}\quad} \end{bmatrix}}} & (58) \end{matrix}$

[0273] and [∂Δ^(ν)/∂T]_(k) as defined in equation (53)

H _(sa)=[1 0 1 0 • • 1 0]^(t)  (59)

[0274] The raw phase measurement in cycles is constructed as: $\begin{matrix} {{\varphi_{RAW}^{v}(\tau)} = \left\lbrack {{{chx}_{-}{cyc}_{-}{upper}} + \frac{{chx}_{-}{cyc}_{-}{cnt}_{-}{lower}}{2^{16}}} \right\rbrack_{x = v}} & (60) \end{matrix}$

[0275] where chx_cyc_cnt_upper, and chx_cyc_cnt_upper are the registers on the TIMED GTA chip containing the whole cycle count and the fractional cycle count for tracking channel x.

[0276] In deriving the truth model for the raw phase measurement, the oscillator phase as a function of true time is given by: ψ(τ) = 2π  f₀^(ref)(τ + T^(*)(τ)) + φ_(set),

[0277] where T* is the uncontrolled time bias.

[0278] The GPS signal coming into the antenna is:

s _(R)(τ)=CA(PRN ^(ν) ,t ^(ν)(τ))·m(t ^(ν)(τ))·sin(2π{circumflex over (ƒ)}_(L1) t ^(ν)(τ)−φ_(iono) ^(L1/C1)(τ))

[0279] If the phase of the signal after code and data wipe-off is φ_(R) (τ):

φ_(R)(τ)=2π{circumflex over (ƒ)}_(L1) t ^(ν)(τ)−φ_(iono) ^(L1/C1)(τ)

[0280] as developed by equation (43), $t_{k}^{v} = {\tau_{k}^{v} + {T^{v}\left( \tau_{k}^{v} \right)} + {\frac{1}{c}{{sa}_{*}^{v}\left( \tau_{k}^{v} \right)}}}$

[0281] and ${\tau_{k} - \tau_{k}^{v}} = {{\Delta^{v}\left( \tau_{k} \right)} + {\frac{1}{c}{I_{g}^{v}\left( \tau_{k} \right)}}}$ ${then}:\quad {\begin{matrix} {\left. {{\varphi_{R}\left( \tau_{k} \right)} = {2\pi \quad {{\hat{f}}_{L1}\left( {\tau_{k}^{v} + {T^{v}\left( \tau_{k}^{v} \right)} + \frac{{sa}_{*}^{v}\left( \tau_{k}^{v} \right)}{c}} \right.}}} \right) - {\phi_{iono}^{{L1}/{C1}}\left( \tau_{k} \right)}} \\ {= {{2\pi \quad {{\hat{f}}_{L1}\left\lbrack {\tau_{k} + {T^{v}\left( \tau_{k} \right)} - {\Delta^{v}\left( \tau_{k} \right)} + \frac{\left( {{{sa}_{*}^{v}\left( \tau_{k}^{v} \right)} - {I_{g}^{v}\left( \tau_{k} \right)}} \right)}{c}} \right\rbrack}} - {\phi_{iono}^{{L1}/{C1}}\left( \tau_{k} \right)}}} \end{matrix}.}$

[0282] The ionospheric phase delay relative to a wave propagating in free space is:

I ₉₂ ^(ν)(τ)=−I _(g) ^(ν)(τ)

[0283] The minus sign indicates the wavefront arrives before a wavefront propagating in free space. Referring to the definition φ_(iono) ^(L1/C1)(τ) in equation (40), the phase advance relative to the code is: $\begin{matrix} {{\phi_{ono}^{{L1}/{C1}}\left( \tau_{k} \right)} = {\frac{2\pi \quad {\hat{f}}_{L1}}{c}\left( {{I_{p}^{v}\left( \tau_{k} \right)} - {I_{g}^{v}\left( \tau_{k} \right)}} \right)}} \\ {= {\frac{4\pi \quad {\hat{f}}_{L1}}{c}{I_{g}^{v}\left( \tau_{k} \right)}}} \end{matrix}$

[0284] where I_(g) ^(ν)(τ_(k)) the ionospheric group delay defined above. Thus:

φ_(R)(τ_(k))=2π{circumflex over (ƒ)}_(L1)(τ_(k) +T ^(ν)(τ_(k))−Δ^(ν)(τ_(k))+(I _(g) ^(ν)(τ_(k))+sa ^(ν)(t))/c)

[0285] The downconverter-sampler effectively mixes the received signal with a k₁ multiplication of the fundamental oscillator. The combined effect of the downconversion and sampling process result in a value for k₁ of: $k_{1} = {\underset{\underset{{downconverter}\quad {effect}}{}}{140\left( {1 + \frac{1}{10} + \frac{1}{45}} \right)} + \underset{\underset{{sampling}\quad {effect}}{}}{\frac{\quad 4}{7}}}$

[0286] The continuous-time representation of the output of the downconverter-sampler is: $\begin{matrix} {{s_{IF}(\tau)} = {{LFP}\left\{ {\sin \quad {{\phi_{R}(\tau)} \cdot {\sin \left( {k_{1}{\psi (\tau)}} \right)}}} \right\}}} \\ {= {\frac{1}{2}{\cos \left\lbrack {{\phi_{R}(\tau)} - {k_{1}{\psi (\tau)}}} \right\rbrack}}} \end{matrix}$

[0287] where LFP{x(t)} represents a low-pass filterring of the process x(t). When locked, the phase tracking loop will match the total phase of this signal, modulo 2π. The model for the raw phase measurement (in cycles) is then:

φ_(RAW) ^(ν)(τ)=([φ_(R)(τ)−k ₁ψ(τ)]/2π)+N ^(ν)+δφ^(ν)

[0288] where N^(ν) is the cycle integer ambiguity which is constant as long as channel ν retains phase lock, and δφ^(ν) represents the phase tracking error, which is regarded as a white noise process at the Kalman crank iterval. The GNS tracking processor samples this process at the MIC interrupts and performs the following deterministic transformation on the raw phase samples to provide the Doppler sense that is conventional to the GPS post-processing community (i.e. consistent with the RINEX file definition), and to eliminate the large variation in phase caused by the known part of the zero Doppler offset: $\begin{matrix} {{\varphi^{v}\left( \tau_{k} \right)} = {- \left\lbrack {{\varphi_{RAW}^{v}\left( \tau_{k} \right)} - \underset{\underset{{zero}\quad {Doppler}\quad {offset}}{}}{{\overset{*}{t}\left( \tau_{k} \right)}\left( {{\hat{f}}_{L1} - {k_{1}f_{0}^{ref}}} \right)}} \right\rbrack}} & (61) \end{matrix}$

[0289] This transformed phase data is what crosses the boundary between the tracking processor and the navigation processor. The model for the phase data is derived by combining the above results: $\begin{matrix} {\begin{matrix} {{{\varphi \quad}^{v}\left( \tau_{k} \right)} = {- \left\lbrack {\frac{\left( \left( {{\phi_{R}\left( \tau_{k} \right)} - {k_{1}{\psi \left( \tau_{k} \right)}}} \right) \right.}{2\pi} + N^{v} + {\delta\varphi}^{v} - {{t^{*}\left( \tau_{k} \right)}\left( {{\hat{f}}_{L1} - {k_{1}f_{0}^{ref}}} \right)}} \right\rbrack}} \\ {= {- \begin{Bmatrix} {{\hat{f}}_{L1}\left( {\tau_{k} + {T^{v}\left( \tau_{k} \right)} - {\Delta^{v}\left( \tau_{k} \right)} + \frac{\left\lbrack {{I_{g}^{v}\left( \tau_{k} \right)} - {{sa}^{v}\left( t_{k} \right)}} \right\rbrack}{c}} \right)} \\ {- {k_{1}\left( {{f_{0}^{ref}\left( {\tau_{k} + {T^{*}\left( \tau_{k} \right)}} \right)} + \frac{\varphi_{set}}{2\pi}} \right)}} \\ {{+ N^{v}} + {\delta\varphi}^{v} - {{t^{*}\left( \tau_{k} \right)}\left( {{\hat{f}}_{L1} - {k_{1}f_{0}^{ref}}} \right)}} \end{Bmatrix}}} \\ {= {{{\hat{f}}_{L1}\left( {{- \tau_{k}} - {T^{v}\left( \tau_{k} \right)} + {\Delta^{v}\left( \tau_{k} \right)} - {t^{*}\left( \tau_{k} \right)}} \right)}\quad + \frac{\left( {{{sa}^{v}\left( \tau_{k} \right)} - {I_{g}^{v}\left( \tau_{k} \right)}} \right)}{\lambda_{L1}} +}} \end{matrix}{{k_{1}{f_{0}^{ref}\left( {\tau_{k} + {T^{*}\left( \tau_{k} \right)} - {t^{*}\left( \tau_{k} \right)}} \right)}} - N^{v} - {\delta\varphi}^{v} + \frac{k_{1}\varphi_{set}}{2\pi}}} & (62) \end{matrix}$

[0290] and λ_(L1)=c/{circumflex over (ƒ)}_(L1) is the GPS L1 wavelength. From equation (4), t*(τ_(k))=τ_(k)+T*(τ_(k)) leading to: $\begin{matrix} {{\begin{matrix} {{\varphi^{v}\left( \tau_{k} \right)} = {{{\hat{f}}_{L1}\left( {{T^{*}\left( \tau_{k} \right)} - {T^{v}\left( \tau_{k} \right)} + {\Delta^{v}\left( \tau_{k} \right)}} \right)} + {\left( {{{sa}^{v}\left( t_{k} \right)} - {I_{g}^{v}\left( \tau_{k} \right)}} \right)/\lambda_{L1}} + b^{v} - {\delta\varphi}^{v}}} \\ {= {{{\hat{f}}_{L1}\left( {{T\left( \tau_{k} \right)} - {\overset{\_}{u}\left( \tau_{k} \right)} - {T^{v}\left( \tau_{k} \right)} + {\Delta^{v}\left( \tau_{k} \right)}} \right)} + {\left( {{{sa}^{v}\left( t_{k} \right)} - {I_{g}^{v}\left( \tau_{k} \right)}} \right)/\lambda_{L1}} + b^{v} - {\delta\varphi}^{v}}} \end{matrix}{{when}\text{:}}}} & \quad \\ \begin{matrix} {{{T\left( \tau_{k} \right)} - {T^{*}\left( \tau_{k} \right)}} = {t - {\tau (t)} - t^{*} - {\tau (t)}}} \\ {= {\int_{\tau_{set}}^{\tau_{k}}{{u(\xi)} \cdot {\xi}}}} \\ {= {\overset{\_}{u}}_{k}} \end{matrix} & (63) \end{matrix}$

[0291] and where the biases have been absorbed into b^(ν)≡−(N^(ν)−^(k) ^(₁) ^(φ) ^(_(set)) /2π).

[0292] The observable processed by the Kalman filter is the difference between the phase measurement and its predicted value based on the current state estimates:

y _(φ) ^(ν)(k)=φ^(ν)(τ_(k))−{circumflex over (φ)}_(k/k−1) ^(ν)

[0293] The estimate of the phase measurement is given by:

{circumflex over (φ)}_(k/k−1) ^(ν)={circumflex over (ƒ)}_(L1)({circumflex over (T)} _(k/k−1) {overscore (u)}(τ_(k))−T ^(ν)(τ_(k))+{circumflex over (Δ)}_(k/k−1) ^(ν))+(ŝâ_(k/k−1) ^(2ν−1) −I _(g,mess) ^(ν)(t _(k) ^(ν)))/λ_(L1) +{circumflex over (b)} _(k/k−1) ^(ν)

[0294] The phase difference measurement is given by: $\begin{matrix} \begin{matrix} {{y_{\phi}^{v}(k)} = {{\varphi^{v}\left( \tau_{k} \right)} - {\hat{\varphi}}_{{k/k} - 1}^{v}}} \\ {= {{{\hat{f}}_{L1}\left( {{T\left( \tau_{k} \right)} - {\overset{\_}{u}\left( \tau_{k} \right)} - {T^{v}\left( \tau_{k} \right)} + {\Delta^{v}\left( \tau_{k} \right)}} \right)} + {\left( {{{sa}^{v}(t)} - {I_{g}^{v}\left( \tau_{k} \right)}} \right)/\lambda_{L1}} + b^{v} - {\delta\varphi}^{v} -}} \\ {\left\lbrack {{{\hat{f}}_{L1}\left( {{\hat{T}}_{{k/k} - 1} - {\overset{\_}{u}\left( \tau_{k} \right)} - {T^{v}\left( \tau_{k} \right)} + {\hat{\Delta}}_{{k/k} - 1}^{v}} \right)} + {\left( {{\hat{s}\quad {\hat{a}}_{{k/k} - 1}^{{2v} - 1}} - {I_{g,{mess}}^{v}\left( t_{k}^{v} \right)}} \right)/\lambda_{L1}} + {\hat{b}}_{{k/k} - 1}^{v}} \right\rbrack} \\ {= {{{\hat{f}}_{L1}\left( {{\delta\Delta}_{k}^{v} + {\delta \quad T_{k}}} \right)} + {\left( {\underset{\underset{{assumed} = 0}{}}{{- {I_{g}^{v}(\tau)}} + {I_{g,{mess}}^{v}\left( t_{k}^{v} \right)}} + {{sa}^{v}(t)} - {\hat{s}\quad {\hat{a}}_{{k/k} - 1}^{{2v} - 1}}} \right)/\lambda_{L1}} + {\delta \quad b_{k}} - {\delta\varphi}^{v}}} \\ {= {{{\hat{f}}_{L1}\left( {{\left\lbrack \frac{\partial\Delta}{\partial T} \right\rbrack \delta \quad T_{k}} + {\left\lbrack \frac{\partial\Delta}{\partial r} \right\rbrack_{k}\delta \quad r_{k}} + {\delta \quad T_{k}}} \right)} + {\delta \quad {{sa}_{{k/k} - 1}^{{2v} - 1}/\lambda_{L1}}} + {\delta \quad b_{k}} - {\delta\varphi}^{v}}} \\ {= {{{\hat{f}}_{L1}\left( {{\left\lbrack {1 + \frac{\partial\Delta}{\partial T}} \right\rbrack \delta \quad T_{k}} + {\left\lbrack \frac{\partial\Delta}{\partial r} \right\rbrack_{k}\delta \quad r_{k}}} \right)} + {\delta \quad {{sa}_{{k/k} - 1}^{{2v} - 1}/\lambda_{L1}}} + {\delta \quad b_{k}} - {\delta\varphi}^{v}}} \end{matrix} & (64) \end{matrix}$

[0295] Because of the similarity between equations 64 and 55, the concatenated measurement y_(φ)(k)≡[y₁₀₀ ¹(k), y_(φ) ²(k) . . . y_(φ) ^(n) ^(_(max)) (k)] can be in the same form as equation (56): $\begin{matrix} \begin{matrix} {{y_{\varphi}(k)} = {{{\frac{1}{\lambda_{L1}}\left\lbrack {H_{w}\quad 0\quad H_{T}\quad 0\quad H_{sa}\quad 0} \right\rbrack}\begin{bmatrix} {\delta \quad w} \\ {\delta\alpha} \\ {\delta \quad T} \\ {\delta ɛ} \\ {\delta \quad {sa}} \\ {\delta \quad b} \end{bmatrix}}_{k} + {\delta\varphi}_{k}}} \\ {= {{{H_{\varphi} \cdot \delta}\quad {x\left( t_{k} \right)}} + {\delta\varphi}_{k}}} \end{matrix} & (65) \end{matrix}$

[0296] where δφ_(k) is modeled as white Gaussian noise with cov(δφ_(k)) = diag(σ_(φ, k)²).

[0297] The concatenated measurement matrices is defined as: $\begin{matrix} \begin{matrix} {y_{k} \equiv \begin{bmatrix} y_{\rho} \\ y_{\varphi} \end{bmatrix}} \\ {H_{k} \equiv \begin{bmatrix} H_{\rho} \\ H_{\varphi} \end{bmatrix}} \\ {R_{k} \equiv \begin{bmatrix} {{cov}\left( {\delta\rho}_{k} \right)} & 0 \\ 0 & {{cov}\left( {\delta\varphi}_{k} \right)} \end{bmatrix}} \end{matrix} & (66) \end{matrix}$

[0298] The measurement update proceeds as follows:

[0299] R_(k)=R_(k) ^(1/2)R_(k) ^(t/2) is factored where R_(k) ^(t/2) is the upper triangular. Note that since R_(k) is diagonal, R_(k) ^(1/2)=diag({square root}{square root over ((R_(k))_(i))}) Q-R decomposition is preformed $\begin{matrix} {\begin{bmatrix} R_{k}^{t/2} & \quad & 0 \\ P_{{k/k} - 1}^{t/2} & H_{k}^{t} & P_{{k/k} - 1}^{t/2} \end{bmatrix} = {T\begin{bmatrix} R_{k}^{t/2} & W_{k}^{t} \\ 0 & P_{k/k}^{t/2} \end{bmatrix}}} & (67) \end{matrix}$

[0300] where P_(k/k−1) ^(t/2) is the factor of the prior covariance, B_(k) ^(t/2) is the factor of the residual covriance, and K_(k)=W_(k)B_(k) ^(−1/2) is the Kalman gain. The posterior covariance factor is P_(k/k) ^(t/2).

[0301] The measurement update of the state is then:

δ{circumflex over (x)} _(k/k) =K _(k) y _(k)  (68)

[0302] Since:

δ{circumflex over (x)} _(k/k−1)=0

[0303] The whole-value dynamic state is re-initialized as:

{circumflex over (x)} _(k/k) ={circumflex over (x)} _(k/k−1) +δ{circumflex over (x)} _(k/k)

[0304] The evolution of the position and velocity states depends on the drag and clock states, but not the SA states or the PDR range biases. The state dynamics can therefore be decoupled by partitioning the state as follows. $\begin{matrix} \begin{matrix} {x_{dyn} = \begin{bmatrix} {w\left( {\tau (t)} \right)} \\ {\alpha (t)} \\ {T(t)} \\ {ɛ(t)} \end{bmatrix}} \\ {x_{sat} = \begin{bmatrix} {{sa}(t)} \\ {b(t)} \end{bmatrix}} \end{matrix} & (69) \end{matrix}$

[0305] The time update is then represented as: $\begin{matrix} {\begin{bmatrix} {x_{dyn}\left( t_{k + 1} \right)} \\ {x_{sat}\left( t_{k + 1} \right)} \end{bmatrix} = \begin{bmatrix} {\varphi \left( {{x_{dyn}\left( t_{k} \right)},t_{k},t_{k + 1}} \right)} \\ {{{\Phi 2}\left( {t_{k + 1},t_{k}} \right)} \cdot {x_{sat}\left( t_{k} \right)}} \end{bmatrix}} & (70) \end{matrix}$

[0306] The update of x_(sat) can be written in terms of the transition matrix φ2(t_(k+1), t_(k)) since its dynamics are linear. The vector φ(x_(dyn)(t_(k)),t_(k),t_(k+1)) is the solution of: ${\frac{\quad}{t}{x_{dyn}(t)}} = {f_{dyn}\left( {{x_{dyn}(t)},t} \right)}$

[0307] integrated from t_(k) to t_(k+1) with x_(dyn)(t_(k)) as the initial condition.

[0308] By using the chain rule, the position and velocity partition w(τ(t)) is evolved according to: $\begin{matrix} \begin{matrix} {\frac{w}{t} = {\frac{{w\left( {\tau (t)} \right)}}{\tau} \cdot \frac{\tau}{t}}} \\ {= {{f_{w}\left( {{w\left( {\tau (t)} \right)},\alpha,{\tau (t)}} \right)}{\overset{.}{\tau}(t)}}} \end{matrix} & (71) \end{matrix}$

[0309] Where {dot over (τ)}(t) is evaluated as described with respect to equation (11), and where the rate of change of w(•) with respect to true time is f_(w)(w(τ(t)),α,τ(t)). The term {dot over (τ)}(t) is the ratio of a true time differential to a receiver time differential and arises because the system is integrating with respect to receiver time. The explicit relation for the true time derivative f_(w)(w(τ(t)),α,τ(t)) is: $\begin{matrix} \begin{matrix} {{f_{w}\left( {{w(\tau)},\alpha,\tau} \right)} = {\frac{}{r}\begin{bmatrix} {r(\tau)} \\ {v(\tau)} \end{bmatrix}}} \\ {\frac{{r(\tau)}}{r} = {v(\tau)}} \\ {\frac{{v(\tau)}}{r} = {{{T_{cts}^{cis}(\tau)} \cdot {g_{cts}\left( {r_{cts}(\tau)} \right)}} - {\frac{\rho \left( {{r_{cts}(\tau)},\tau} \right)}{2\quad \beta_{0}}{\left( {1 + \alpha} \right) \cdot}}}} \\ {{{{v^{rel}(\tau)}} \cdot {v^{rel}(\tau)}}} \end{matrix} & (72) \end{matrix}$

[0310] where r_(cts)(τ)≡T_(cis) ^(cts)(τ)·r(τ) is the CTS position of the TIMED CM, g_(cts)(r_(cts)(τ)) is the acceleration of gravity, T_(cis) ^(cts)(τ) is the transformation from the conventional inertial system to the conventional terrestrial system (see “GPS Theory and Practice” by B. Hoffmann-Wellenhof, et. al., published by Springer-Verlag 1992, the contents thereof which is incorporated herein by reference), ρ(r(τ),τ) is the mass density from the atmospheric model, and β₀ is the nominal TIMED ballistic coefficient, defined as M/C_(d)·A. The earth-relative velocity coordinatized in the CIS frame is given by:

v ^(rel)(τ)=v(τ)−ω_(e) ×r(τ)

[0311] where ω_(e) is the angular velocity of the Earth in the CIS frame. Note that the explicit dependence on receiver time is suppressed with the understanding that τ=τ(t). The time rate of change of the clock error is given by the following form of equation (12): $\begin{matrix} \begin{matrix} {{\overset{.}{T}(t)} = \frac{{u(t)} - {ɛ(t)}}{1 + {u(t)} - {ɛ(t)}}} \\ {= {\left( {{u(t)} - {ɛ(t)}} \right){\overset{.}{\tau}(t)}}} \end{matrix} & (73) \end{matrix}$

[0312] The time rate of change of x_(dyn) is then: $\left. \begin{matrix} {{f_{dyn}\left( {{x_{dyn}(t)},t} \right)} = \left\lbrack \begin{matrix} {{f_{w}\left( {{w\left( {\tau (t)} \right)},\alpha,{\tau (t)}} \right)} \cdot {\overset{.}{\tau}(t)}} \\ {0\quad} \\ {{\left( {{u(t)} - {ɛ(t)}} \right) \cdot {\overset{.}{\tau}(t)}}\quad} \\ {0\quad} \end{matrix} \right.} \\ {{\overset{.}{\tau}(t)} = \frac{1}{1 + {u(t)} - {ɛ(t)}}} \end{matrix} \right\rbrack$

[0313] The PDR biases are not dynamically coupled with the SA states, therefor the transition matrix Φ2(t_(k+1),t_(k)) can be partitioned as: $\begin{matrix} {{\Phi_{sat}\left( {t_{k + 1},t_{k}} \right)} = \begin{bmatrix} {\Phi_{sa}\left( {t_{k + 1},t_{k}} \right)} & {0\quad} \\ {0\quad} & {\Phi_{pdr}\left( {t_{k + 1},t_{k}} \right)} \end{bmatrix}} & (75) \end{matrix}$

[0314] The PDR bias states are true biases, they have no dynamics. However the transition matrix must take account of rising and setting satellites. (Loss of lock is modeled by increasing the covariance on the PDR biases to infinity.). To do this, a list of the PRN numbers is constructed for the satellites in each tracker. At receiver time t, PRN(t)_(i) is the PRN number of the satellite being tracked by receiver channel i, for iε{1,2, . . . , n_(max)}. If channel i is not tracking any satellite PRN(t)_(i)=0. The selector matrix S1(t_(k+1),t_(k)) is defined as:

S 1(t _(k+1) ,t _(k))_(i,j)=δ(PRN(t _(k+1))_(i) , prn(t _(k))_(j))  (76)

[0315] Where ${\delta \left( {i,j} \right)} = \left\{ \begin{matrix} 1 & {\quad {{i = j},{\neq 0},{j \neq 0}}} & \quad \\ \quad & \quad & {i,{j\quad \varepsilon \left\{ {1,2,{3\quad \ldots}\quad,n_{\max}} \right\}}} \\ 0 & {{otherwise}\quad} & \quad \end{matrix} \right.$

[0316] For instance, assume a scenario with 3 tracking channels (n_(max)=3) and PRN 10, 14, and 22 are being tracked by channels 1, 2, and 3 at t_(k). At measurement time t_(k+1), PRN is 14, 10, and 20 are being tracked by channels 1, 2, and 3: $\begin{matrix} {{{PRN}\left( t_{k} \right)} = \left\lbrack {10\quad 14\quad 22} \right\rbrack} \\ {{{PRN}\left( t_{k + 1} \right)} = \left\lbrack {14\quad 10\quad 20} \right\rbrack} \\ {{{S1}\left( {t_{k + 1},t_{k}} \right)} = \begin{bmatrix} 0 & 1 & 0 \\ 1 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}} \end{matrix}$

[0317] S1(t_(k+1),t_(k)) connects the satellite identities at time t_(k) to the identities at time t_(k+1). Then:

Φ_(pdr)(t _(k+1) ,t _(k))=S 1(t _(k+1) ,t _(k))  (77)

[0318] For each satellite, SA is modeled as a second order Markov process: The solution can be written in terms of the transition matrix as: $\begin{matrix} {\frac{}{t} = {\begin{bmatrix} {s_{1}(t)} \\ {s_{2}(t)} \end{bmatrix} = {\begin{bmatrix} {{- 2} \cdot \xi \cdot {- \varpi_{n}^{2}}} \\ {1\quad 0} \end{bmatrix}\begin{bmatrix} {s_{1}(t)} \\ {s_{2}(t)} \end{bmatrix}}}} \\ {{\frac{}{t}{s(t)}} = {F_{mkv} \cdot {s(t)}}} \end{matrix}$

[0319] Written in terms of the transition matrix, the foregoing is:

s(t _(k+1))=φ_(mkv)(t _(k+1) ,t _(k))·s(t _(k))

[0320] where φ_(mkv)(t_(k+1),t_(k)) is given by:

φ_(mkv)(t _(k+1) ,t _(k))=α₀ I=α ₁ ·F _(mkv) ·Δt (2×2)

u=−Δt·ξ·{overscore (ω)} _(n)

ω=Δt·{overscore (ω)} _(n){square root}{square root over (1−ξ²)}

α₀ =−e ^(u)·(u·sin ω−ω·cos ω)/ω

α₁ =e ^(u)·sin ω/ω

Δt=t _(k+1) −t _(k)

[0321] The full SA state vector is the concatenation of n_(max) copies of the per-link SA states, so that the full SA transition matrix is block diagonal with φ_(mkv)(t_(k+1),t_(k)) on the diagonals:

sa(t _(k+1) ⁻)=Φ_(mkv)(t _(k+1),t_(k))·sa(t _(k))

Φ_(mkv)(t _(k+1) ,t _(k))=diag[φ_(mkv)(t _(k+1) , t _(k))] (2·n _(max)=2·n _(max))  (79)

[0322] where t_(k+1) ⁻ is a fictional time prior to updating the satellite states to account for the addition and deletion of satellites. Bookkeeping is accomplished with the selector matrix defined in equation (76) by segregating the SA states into terms associated with range (sa_1) and those associated with range rate (sa_2): $\begin{bmatrix} {{sa\_}1\left( t_{k + 1}^{-} \right)} \\ {{sa\_}2\left( t_{k + 1}^{-} \right)} \end{bmatrix} = {P \cdot {{sa}\left( t_{k + 1}^{-} \right)}}$

[0323] where P is a (constant) permutation matrix given by: $\begin{matrix} {\begin{matrix} {P = \left\lbrack {E_{1}\quad {E_{2}\quad \cdot \quad E_{m}\quad \cdot \cdot \quad E_{n_{\max}}}} \right\rbrack} & {\quad \left( {{2 \cdot n_{\max}} \times {2 \cdot n_{\max}}} \right)} \\ {E_{m} = \begin{bmatrix} e_{m} & 0 \\ 0 & e_{m} \end{bmatrix}} & {\left( {{2 \cdot n_{\max}} \times 2} \right)\quad} \\ {e_{m} = \begin{bmatrix} 0 & 0 & \cdot & \cdot & \underset{m^{th}{component}}{\begin{matrix} 0 & 1 & 0 \end{matrix}} & \cdot & {\cdot \quad 0} \end{bmatrix}^{t}} & {\left( {n_{\max} \times 1} \right)\quad} \end{matrix}\quad} & (80) \end{matrix}$

[0324] The addition and deletion of satellites is accomplished with the selector matrix defined above: $\begin{bmatrix} {{sa\_}1\left( t_{k + 1}^{+} \right)} \\ {{sa\_}2\left( t_{k + 1}^{+} \right)} \end{bmatrix} = {\begin{bmatrix} {{S1}\left( {t_{k + 1},t_{k}} \right)} & 0 \\ 0 & {{S1}\left( {t_{k + 1},t_{k}} \right)} \end{bmatrix}\begin{bmatrix} {{sa\_}1\left( t_{k + 1}^{-} \right)} \\ {{sa\_}2\left( t_{k + 1}^{-} \right)} \end{bmatrix}}$

[0325] P is a permutation matrix, there for its inverse is its transpose so the SA states are returned to their original order by premultiplying by the transpose: ${{sa}\left( t_{k + 1} \right)} = {P^{t}\begin{bmatrix} {{sa\_}1\left( t_{k + 1}^{+} \right)} \\ {{sa\_}2\left( t_{k + 1}^{+} \right)} \end{bmatrix}}$

[0326] The complete update to the SA states is:

sa(t _(k+1))=Φ_(sa)(t _(k+1) ,t _(k))·sa(t _(k))

[0327] where:

Φ_(sa)(t _(k+1) ,t _(k))=P ^(t) ·S 2(t _(k+1) ,t _(k))·P·Φ _(mkv)(t _(k+1) ⁻ ,t _(k)) $\begin{matrix} {{{S2}\left( {t_{k + 1},t_{k}} \right)} = \begin{bmatrix} {{S1}\left( {t_{k + 1},t_{k}} \right)} & 0 \\ 0 & {{S1}\left( {t_{k + 1},t_{k}} \right)} \end{bmatrix}} & (81) \end{matrix}$

[0328] The time update of the extended Kalman filter state estimates is exactly the same as the evolution of the Kalman filter state described in the foregoing truth model, i.e.: $\begin{bmatrix} {{\hat{X}}_{dyn}\left( t_{k + {1/k}} \right)} \\ {{\hat{X}}_{sat}\left( t_{k + {1/k}} \right)} \end{bmatrix} = \begin{bmatrix} {\varphi \left( {{{\hat{X}}_{dyn}\left( t_{k/k} \right)},t_{k},t_{k + 1}} \right)} \\ {{\Phi_{sat}\left( {t_{k + 1},t_{k}} \right)} \cdot {{\hat{X}}_{sat}\left( t_{k/k} \right)}} \end{bmatrix}$

[0329] The TIMED Kalman filter is a square root covariance implementation wherein the state error covariance P=cov(δx) is maintained in factored form as P=P^(t/2)·P^(1/2) where P^(t/2) is upper triangular and P^(1/2)=(P^(t/2))^(t). The the covariance factor update is achieved by post multiplying the transpose of the transition matrix:

{tilde over (P)} _(k+1/k) ^(t/2) =P _(k/k) ^(t/2)·Φ(t _(k+1) ,t _(k))^(t)  (82)

[0330] where {tilde over (P)}_(k+1/k) ^(t/2) is the state error covariance after the deterministic update and prior to the stochastic update.

[0331] The full transition matrix used in equation (82) is: $\begin{bmatrix} {\Phi_{dyn}\left( {t_{k + 1},t_{k}} \right)} & 0 \\ 0 & {\Phi_{sat}\left( {t_{k + 1},t_{k}} \right)} \end{bmatrix}\quad$

[0332] where Φ_(sat)(t _(k+1),t_(k)) is as computed above, and Φ_(dyn)(t_(k+1),t_(k)) is the solution to: $\begin{matrix} {{\frac{\quad}{\xi}{\Phi_{dyn}\left( {\xi,t_{k}} \right)}} = {{F_{dyn}(\xi)} \cdot ~{\Phi_{dyn}\left( {\xi,t_{k}} \right)}}} & (83) \end{matrix}$

[0333] between ξ=t_(k) and ξ=t_(k+1). The initial condition is Φ_(dyn)(t_(k),t_(k))=I. F_(dyn) is the gradient of f_(dyn) with respect to x_(dyn)=[w^(t),α, T,ε]^(t) as derived below: $\begin{matrix} \begin{matrix} {F_{dyn} \equiv \frac{\partial f_{dyn}}{\partial x_{dyn}}} \\ {{= \begin{bmatrix} \frac{\partial\left( {f_{x} \cdot \overset{.}{\tau}} \right)}{\partial w} & \frac{\partial\left( {f_{x} \cdot \overset{.}{\tau}} \right)}{\partial\alpha} & \frac{\partial\left( {f_{x} \cdot \overset{.}{\tau}} \right)}{\partial T} & \frac{\partial\left( {f_{x} \cdot \overset{.}{\tau}} \right)}{\partial ɛ} \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & \frac{\partial\overset{.}{T}}{\partial ɛ} \\ 0 & 0 & 0 & 0 \end{bmatrix}}} \end{matrix} & (84) \end{matrix}$

[0334] The partitions of F_(dyn) are: $\begin{matrix} {\frac{\partial\left( {f_{w} \cdot \overset{.}{\tau}} \right)}{\partial w} = {\frac{\partial f_{w}}{\partial w} \cdot \overset{.}{\tau}}} \\ {\frac{\partial\left( {f_{w} \cdot \overset{.}{\tau}} \right)}{\partial\alpha} = {\frac{\partial f_{w}}{\partial\alpha} \cdot \overset{.}{\tau}}} \\ {\frac{\partial\left( {f_{w} \cdot \overset{.}{\tau}} \right)}{\partial T} = {{\frac{\partial f_{w}}{\partial T} \cdot \overset{.}{\tau}} + {f_{w} \cdot \frac{\partial\overset{.}{\tau}}{\underset{\underset{= 0}{}}{\partial T}}}}} \\ {= {{{\frac{\partial f_{w}}{\partial\tau} \cdot \frac{\partial(t)}{\underset{\underset{= 1}{}}{\partial T}}}\overset{.}{\tau}} = {{- \frac{\partial f_{w}}{\partial\tau}}\overset{.}{\tau}}}} \\ {\frac{\partial\left( {f_{w} \cdot \overset{.}{\tau}} \right)}{\partial ɛ} = {{f_{w} \cdot \frac{\partial\overset{.}{\tau}}{\partial ɛ}} = {f_{w} \cdot {\overset{.}{\tau}}^{2}}}} \\ {\frac{\partial\overset{.}{T}}{\partial ɛ} = {{- \frac{\partial\left( {1 - \overset{.}{\tau}} \right)}{\partial ɛ}} = {\frac{\partial\overset{.}{\tau}}{\partial ɛ} = {- {\overset{.}{\tau}}^{2}}}}} \end{matrix}$

[0335] In the last two rows above: $\frac{\partial\overset{.}{\tau}}{\partial ɛ} = {{\frac{\partial\quad}{\partial ɛ} \cdot \frac{1}{\left( {1 + u - ɛ} \right)}} = {\left\lbrack \frac{1}{\left( {1 + u - ɛ} \right)} \right\rbrack^{2} = {\overset{.}{\tau}}^{2}}}$

[0336] The above results are substituted into equation (84): $\begin{matrix} {F_{dyn} = \begin{bmatrix} \frac{\partial f_{w}}{\partial w} & {\frac{\partial f_{w}}{\partial\alpha} \cdot \overset{.}{\tau}} & {{- \frac{\partial f_{w}}{\partial\tau}} \cdot \overset{.}{\tau}} & {f_{w} \cdot {\overset{.}{\tau}}^{2}} \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & {- {\overset{.}{\tau}}^{2}} \\ 0 & 0 & 0 & 0 \end{bmatrix}} & (85) \end{matrix}$

[0337] where {dot over (τ)}=(1+u(t)−ε(t))⁻¹ and f_(w) is given by equation (72). The ∂f_(w)/∂w partition is: $\begin{matrix} \begin{matrix} {\frac{\partial f_{w}}{\partial w} = \begin{bmatrix} \frac{\partial\overset{.}{r}}{\partial r} & \frac{\partial\overset{.}{r}}{\partial v} \\ \frac{\partial\overset{.}{v}}{\partial r} & \frac{\partial\overset{.}{v}}{\partial v} \end{bmatrix}} \\ {\frac{\partial\overset{.}{r}}{\partial r} = 0} \\ {\frac{\partial\overset{.}{r}}{\partial v} = I_{3 \times 3}} \\ {\frac{\partial\overset{.}{v}}{\partial r} = {\frac{\partial\quad}{\partial r}\left\{ {{{T_{cts}^{cis}(\tau)}{g_{cts}\left( r_{cts} \right)}} - {\frac{\rho \left( {r_{cts},\tau} \right)}{2 \cdot \beta_{0}}\left( {1 + \alpha} \right){v^{rel}}v^{rel}}} \right\}}} \\ {\cong {{{T_{cts}^{cis}(\tau)}{\frac{\partial g_{cts}}{\partial r_{cts}} \cdot \frac{\partial r_{cts}}{\partial r}}} - {\frac{\rho \left( {r_{cts},\tau} \right)}{2 \cdot \beta_{0}}\left( {1 + \alpha} \right)\frac{\partial\quad}{\partial r}\left\{ {{v^{rel}}v^{rel}} \right\}}}} \\ {= {{{T_{cts}^{cis}(\tau)}\frac{\partial g_{cts}}{\partial r_{cts}}{T_{cis}^{cts}(\tau)}} + {\frac{\rho \left( {r_{cts},\quad \tau} \right)}{2 \cdot \beta_{0}}\left( {1 + \alpha} \right)\left( \frac{{{v^{rel} \cdot v^{rel}}I} + {v^{rel}\left( v^{rel} \right)}^{t}}{\left| v^{rel} \right|} \right)\left\{ {\varpi_{e}x} \right\}}}} \\ {\frac{\partial\overset{.}{v}}{\partial v} = {\frac{\partial\quad}{\partial v}\left\{ {{{T_{cts}^{cis}(\tau)}{g_{cts}\left( r_{cts} \right)}} - {\frac{\rho \left( {r_{cts},\tau} \right)}{2 \cdot \beta_{0}}\left( {1 + \alpha} \right)}} \middle| v^{rel} \middle| v^{rel} \right\}}} \\ {= {{- \frac{\rho \left( {r_{cts},\tau} \right)}{2 \cdot \beta_{0}}}\left( {1 + \alpha} \right)\left( \frac{{{v^{rel} \cdot v^{rel}}I} + {v^{rel}\left( v^{rel} \right)}^{t}}{\left| v^{rel} \right|} \right)}} \end{matrix} & (86) \end{matrix}$

[0338] In the above differentiations, variation of density with position are not considered. The ∂f_(w)/∂α partition is given by: $\begin{matrix} {\frac{\partial f_{w}}{\partial\alpha} = \begin{bmatrix} \frac{\partial\overset{.}{r}}{\partial\alpha} \\ \frac{\partial\overset{.}{v}}{\partial\alpha} \end{bmatrix}} \\ {= \left\lbrack {{- \frac{{\rho \left( {r_{cts},\tau} \right)}^{0}}{2 \cdot \beta_{0}}} \cdot} \middle| v^{rel} \middle| {\cdot v^{rel}} \right\rbrack} \end{matrix}$

[0339] The ∂f_(w)/∂τ partition is: $\begin{matrix} \begin{matrix} {\frac{\partial f_{w}}{\partial\tau} = \begin{bmatrix} \frac{\partial\overset{.}{f_{w}}}{\partial\tau} \\ \frac{\partial\overset{.}{v}}{\partial\tau} \end{bmatrix}} \\ {= \begin{bmatrix} {\overset{.}{v}(\tau)} \\ {\overset{¨}{v}(\tau)} \end{bmatrix}} \end{matrix} & (87) \end{matrix}$

[0340] where {dot over (v)}(τ) is as given in equation (72) and the important terms in {umlaut over (v)}(τ) are given by: $\begin{matrix} \begin{matrix} {{\overset{¨}{v}(\tau)} = {\frac{\partial}{\partial(\tau)}\left\{ {{{T_{cts}^{cis}(\tau)} \cdot {g_{cts}\left( {{T_{cis}^{cts}(\tau)}{r(\tau)}} \right)}} - {\frac{\rho \left( {r_{cts},\tau} \right)}{2 \cdot \beta_{0}}\left( {1 + \alpha} \right)}} \middle| v^{rel} \middle| v^{rel} \right\}}} \\ {\cong {{{{\overset{.}{T}}_{cts}^{cis}(\tau)} \cdot {g_{cts}\left( r_{cts} \right)}} + {{T_{cts}^{cis}(\tau)}{\frac{\partial g_{cts}}{\partial r_{cts}} \cdot \frac{\left( {{T_{cis}^{cts}(\tau)}{r(\tau)}} \right)}{\tau}}}}} \\ {{- \frac{\rho \left( {r_{cts},\tau} \right)}{2 \cdot \beta_{0}}}\left( {1 + \alpha} \right)\left( \frac{{v^{rel}\left( {{\overset{.}{v}}^{rel} \cdot v^{rel}} \right)} + {{\overset{.}{v}}^{rel}\left( {v^{rel} \cdot v^{rel}} \right)}}{\left| v^{rel} \right|} \right)} \\ {= {{{{\overset{.}{T}}_{cts}^{cis}(\tau)} \cdot {g_{cts}\left( r_{cts} \right)}} + {{T_{cts}^{cis}(\tau)}\frac{\partial g_{cts}}{\partial r_{cts}}\left( {{{\overset{.}{T}}_{cis}^{cts}r} + {T_{cis}^{cts}v}} \right)}}} \\ {{- \frac{\rho \left( {r_{cts},\tau} \right)}{2 \cdot \beta_{0}}}\left( {1 + \alpha} \right)\left( \frac{{v^{rel}\left( {{\overset{.}{v}}^{rel} \cdot v^{rel}} \right)} + {{\overset{.}{v}}^{rel}\left( {v^{rel} \cdot v^{rel}} \right)}}{\left| v^{rel} \right|} \right)} \end{matrix} & (88) \end{matrix}$

[0341] where the time rate of change of the Earth relative velocity is:

v ^(rel) ={dot over (v)}−{overscore (ω)} _(ex) v  (89)

[0342] The effects of process noise on the covariance factor are accounted for by the following Q-R decomposition: $\begin{matrix} {{T\begin{bmatrix} P_{k + {1/k}}^{t/2} \\ 0 \end{bmatrix}} = \begin{bmatrix} {\overset{\sim}{P}}_{k + {1/k}}^{t/2} \\ {QD}^{t/2} \end{bmatrix}} & (90) \end{matrix}$

[0343] where T is an orthonormal matrix and QD is a discrete-time process noise covariance matrix for the entire state, which is partitioned as: $\begin{matrix} {{QD}\begin{bmatrix} {QD}_{dyn} & 0 & 0 \\ 0 & {QD}_{sa} & 0 \\ 0 & 0 & {QD}_{pdr} \end{bmatrix}} & (91) \end{matrix}$

[0344] where QD_(dyn)=cov(δx_(dyn)) is the error covariance of the x_(dyn) partition of the state. QD_(dyn) is the solution of: $\begin{matrix} {{\frac{}{\xi}{QD}_{dyn}} = {{{F_{dyn}(\xi)} \cdot {QD}_{dyn}} + {{QD}_{dyn} \cdot {F_{dyn}^{t}(\xi)}} + {\cdot Q_{dyn}}}} & (92) \end{matrix}$

[0345] between ξ=t_(k) and ξ=t_(k+1). The initial condition is QD_(dyn)=0. The square root QD^(1/2) is given by: QD^(1/2)=US^(1/2) where QD=USU^(t) is the SVD factorization of (the symmetric) QD. (QD^(1/2) obtained in this way is a symmetric square root, not lower triangular. Although lower triangular square roots are baselined in the Levy SRCF algorithm, any square root will do)

[0346] The process noise for the dynamic states (Q_(dyn)) is essentially a tuning parameter. The physics of the problem dictate that: 1) There should be no process noise driving position. 2) There should be enough process noise driving the velocity to cover all of the unmodeled accelerations (third body effects, Earth tides and so on). 3) The process noise on the drag parameter must be large enough to allow the filter to react to changes in the conditions in the upper atmosphere. 4) There should be enough process noise driving the clock frequency error e to model the oscillator Allan variance.

[0347] Analytically, the process noise for the SA states is: ${QD}_{sa} = {{block}\quad {diag}\quad \left( \sum\limits_{v} \right)}$

[0348] where the blocks are initialized to the steady state SA covariance matrix if the satellite is new in track, or the accumulated process noise appropriate for an interval of length Δ=t_(k+1)−t_(k) if it is not a new satellite: $\begin{matrix} {\sum\limits_{v}{= \left\{ \begin{matrix} {{\sum\limits_{\infty}{{if}\quad v^{{th}\quad}{row}\quad {of}\quad {{S1}\left( {t_{k + 1},t_{k}} \right)}}} = 0} \\ {\sum\limits_{\Delta}{otherwise}} \end{matrix} \right.}} & (93) \end{matrix}$

[0349] where the steady-state covariance is: $\begin{matrix} {\sum\limits_{\infty}{= \begin{bmatrix} \sigma_{sa\_ vel}^{2} & 0 \\ 0 & \sigma_{sa\_ rng}^{2} \end{bmatrix}}} & (94) \end{matrix}$

[0350] σ_(sa) _(—) _(rng) is the steady state standard deviation of the sa process (currently 75 m), σ_(sa) _(—) _(vel)=σ_(sa) _(—) _(rng){overscore (ω)}_(n) is the velocity sigma, and {overscore (ω)}_(n) is the natural frequency of the sa markov (currently 300 seconds). The covariance for the existing satellites is: $\begin{matrix} \begin{matrix} {\sum\limits_{\Delta}{= {q_{s}\begin{bmatrix} c & b \\ b & a \end{bmatrix}}}} \\ {b = {\frac{^{{- 2}{\varpi}_{n}\Delta}}{4{\varpi_{n}^{2}\left( {1 - } \right)}}\left( {1 - {\cos \left( {2\varpi_{nd}\Delta} \right)}} \right)}} \\ {c = {\frac{1}{4{\varpi}_{n}} + {\frac{^{{- 2}{\varpi}_{n}\Delta}}{4\varpi_{{nd}/\varpi_{n}}^{2}}\left( {{- \frac{1}{}} + {\cos \left( {2\varpi_{nd}\Delta} \right)} + {\frac{\varpi_{nd}}{\varpi_{n}}{\sin \left( {2\varpi_{nd}\Delta} \right)}}} \right)}}} \\ {a = {\frac{1}{4{\varpi}_{n}^{3}} - {\frac{^{{- 2}{\varpi}_{n}\Delta}}{4\varpi_{n}\varpi_{nd}^{2}}\left( {\frac{1}{} - {\cos \left( {2\varpi_{nd}\Delta} \right)} + {\frac{\varpi_{nd}}{\varpi_{n}}{\sin \left( {2\varpi_{nd}\Delta} \right)}}} \right)}}} \\ {{\varpi_{nd} = \begin{matrix} {\varpi_{n}\sqrt{1 - ^{2}}} & {\beta_{1} = {2{\varpi}_{n}}} & {\beta_{2}\varpi_{n}^{2}} & {q_{s} = {\sigma_{sa\_ rng}^{2}\beta_{1}\beta_{2}}} \end{matrix}}\quad} \\ \quad \end{matrix} & (95) \end{matrix}$

[0351] The process noise for the carrier cycle ambiguities is zero unless the satellite is new or a break in track has occurred, in which case it is set to a very large value. Thus:

QD _(pdr)=1.e9·diag(p _(ν))  (96)

[0352] where: $\begin{matrix} {{{QD}_{pdr} = {1 \cdot {e9} \cdot {{diag}\left( p_{v} \right)}}}{{{where}:\quad p_{v}} = \left\{ \begin{matrix} {{1\quad {if}\quad v^{th}},{{v^{th}{element}\quad {of}\quad {{S1}\left( {t_{k + 1},t_{k}} \right)}} = {{0\quad {or}\quad {loss\_ lock}_{v}} = 1}}} \\ {0\quad {otherwise}} \end{matrix} \right.}} & (96) \end{matrix}$

[0353] The GNS state can be initialized or reset by any one of three different ways:

[0354] 1) The GNS state can self-initialize (or reinitialize) using two GPS point solutions.

[0355] 2) Initially, the state can be set using preloaded orbital insertion data.

[0356] 3) The state can be set (or reset) by a command upload of a NORAD state vector.

[0357] Two GPS point solutions are used to initialize the state and covariance partitions for all of the dynamic states except for drag. In each point solution, the system solves for the receiver position and clock parameters. It assumes constant velocity, the two point solutions are therefor treated as data for estimating the position, velocity, receiver clock error, and receiver fractional frequency error at the second epoch. At least 4 satellites must be in track before point solutions can be obtained which are defined completely by the data. With the inclusion of prior information on the clock and fractional frequency error, the technique works with three satellites. The information on the clock is obtained from the constraint that the propagation delay is around 60 milliseconds (+/−20 milliseconds) and is applied in the non-linear least squares point solutions. The information on the fractional frequency error is obtained from preflight calibration and is applied in the combining procedure.

[0358] Under the assumption of constant velocity, and assuming there is no MIC control being applied, equation (9) may be approximated as {dot over (T)}=−ε, then: $\begin{matrix} \underset{\underset{z}{}}{\begin{bmatrix} {r\left( t_{1} \right)} \\ {T\left( t_{1} \right)} \\ {r\left( t_{2} \right)} \\ {T\left( t_{2} \right)} \end{bmatrix} = {\underset{\underset{H}{}}{\begin{bmatrix} I & {{{- I} \cdot \Delta}\quad t} & 0 & 0 \\ 0^{t} & 0^{t} & 1 & {\Delta \quad t} \\ I & 0 & 0 & 0 \\ 0^{t} & 0^{t} & 1 & 0 \end{bmatrix}}\underset{\underset{x}{}}{\begin{bmatrix} {v\left( {\tau \left( t_{2} \right)} \right)} \\ {r\left( {\tau \left( t_{t} \right)} \right)} \\ {{T\left( t_{2} \right)}\quad} \\ {{ɛ\left( t_{2} \right)}\quad} \end{bmatrix}}}} & (97) \end{matrix}$

[0359] z=[z₁ ^(t),z ₂ ^(t)] with {circumflex over (z)}_(i)=[{circumflex over (r)}^(t)(t_(i)),{circumflex over (T)}(t_(i))]^(t) is then calculated from the position-clock point solutions at epochs i=1,2 (as described below). The point solution estimate errors are regarded as independent (although this is not true for the errors caused by selective availability), to enable the system to solve the Bayesian least-squares problem: $\begin{matrix} {z = {{Hx} + v}} \\ {{x^{\sim}{N\left( {\mu,\sum} \right)}}} \\ {{v^{\sim}{N\left( {0,R} \right)}}} \end{matrix}$

[0360] where H is as above, Σ and μ represent any prior information on x, and R is the measurement noise associated with uncertainty of the single point solutions given below. The solution to this problem is obtained using the same method that was used to perform the measurement update, namely equations (67) and (68). This is a square root procedure requiring that the covariance matrices be factored as $\sum{= {\sum\limits^{1/2}\quad \sum\limits^{1/2}}}$

[0361] and R=R^(1/2)R^(1/2) where $\sum\limits^{1/2}$

[0362] and R^(1/2) are upper triangular. Since only prior information need be incorporated in the case where there are only three satellites in the solution; $\sum\limits^{1/2}$

[0363] and μ (partitioned consistent with the partitioning of x in equation (97)) are of the form: $\begin{matrix} {\sum\limits^{1/2}{= \begin{bmatrix} {\infty I} & 0 & 0 & 0 \\ 0^{t} & {\infty I} & 0 & 0 \\ 0^{t} & 0^{t} & \infty & 0 \\ 0^{t} & 0^{t} & 0 & a \end{bmatrix}}} \\ {a = \left\{ \begin{matrix} {{\sigma_{ɛ}\quad {three}\quad {satellite}\quad {solutions}}\quad} \\ {\infty \quad {four}\quad {or}\quad {more}\quad {satellite}\quad {solutions}} \end{matrix} \right.} \\ {\mu = \left\lbrack {0^{t},0^{t},0,b} \right\rbrack^{t}} \\ {b = \left\{ \begin{matrix} {{ɛ_{0}\quad {three}\quad {satellite}\quad {solutions}}\quad} \\ {0\quad {four}\quad {or}\quad {more}\quad {satellite}\quad {solutions}} \end{matrix} \right.} \end{matrix}$

[0364] where ε₀ and σ_(ε) are the prior estimate of the fractional frequency error and its associated one-sigma uncertainty. The noise factor is given by: $R^{1/2} = \begin{bmatrix} \Gamma_{1}^{1/2} & 0 \\ 0 & \Gamma_{2}^{1/2} \end{bmatrix}$

[0365] where Γ_(i) ^(1/2) are the covariance matrices from the point solution nonlinear least-squares procedure described below. The aposteriori covariance and state estimate are nexed mapped into the Kalman filter order.

[0366] The point solutions used above are arrived at by the following a nonlinear least squares solution to the point navigation equations.

[0367] Starting with an initial guess for the receiver position in the inertial frame ({circumflex over (r)}) and the receiver clock error ({circumflex over (T)}), the initial guess for the clock bias is obtained by subtracting the estimate of the transmit time corrected for a mean propagation time of 60 milliseconds with the receiver reference time from the tracking processor:

{circumflex over (T)}=t _(k)−(t _(k) ^(ν)+0.060)

[0368] The true time at the receiver τ=t+{circumflex over (T)} is then determined: For tracking channels v=1, n_(max), the implicit light time equation is solved: $\Delta^{v} = {\frac{1}{c}{{{r^{v}\left( \tau^{v} \right)} - {r^{\hat{}}(\tau)}}}}$

 τ^(ν)=τ−Δ^(ν)  (98)

r ^(ν)(τ)=T _(cts) ^(cis)(τ)r _(cts) ^(ν)(τ)

[0369] where r_(cts) ^(ν)(τ) is the satellite position according to the message ephemeris

[0370] After convergence, the unit vectors are computed: $\begin{matrix} {u^{v} = \frac{{r^{v}\left( {\tau - \Delta^{2}} \right)} - {r^{\hat{}}(\tau)}}{{{r^{v}\left( {\tau - \Delta^{2}} \right)} - {\hat{r}(\tau)}}}} & (99) \end{matrix}$

[0371] The sensitivity matrix is then created: $\begin{matrix} {M = \begin{bmatrix} {- \left( u^{1} \right)^{t}} & 1 \\ {- \left( u^{2} \right)^{t}} & 1 \\ \vdots & \vdots \\ {{- \left( u^{n_{\max}} \right)^{t}}\quad} & 1 \end{bmatrix}} & \quad & (100) \end{matrix}$

[0372] If channel ν is not tracking a satellite, that row of M is zeroed out.

[0373] The measurement vector is formed:

y=[y ₁ ,y ₂ , . . . y _(n) _(max) ,0]  (101)

[0374] where: $y_{v} = {\rho^{v} - \underset{\underset{{predicted}\quad {pseudorange}}{}}{c\left\lbrack {\Delta^{v} + \left( {\hat{T} - {T^{v}\left( \tau^{v} \right)}} \right)} \right\rbrack}}$

[0375] where ρ^(ν) is the raw pseudo-range measurement and {circumflex over (T)}((τ^(ν)) is the satellite clock bias computed from the message data. (The SA and the ionosphere are ignored in the foregoing initialization procedure.)

[0376] Next, errors in the state are determined and the state is updated: $\begin{matrix} {\begin{bmatrix} \hat{r} \\ \hat{T} \end{bmatrix}_{new} = {\begin{bmatrix} \hat{r} \\ \hat{T} \end{bmatrix}_{old} + {By}}} & (102) \end{matrix}$

[0377] where B is the Kalman gain associated with the Bayesian least-squares problem:

y=Mx+v

x{tilde over ()}N(0,D)

v{tilde over ()}N(0,E)

[0378] $\begin{matrix} {D = \begin{bmatrix} {\infty \quad I} & 0 \\ 0^{t} & e \end{bmatrix}} \\ {e = \left\{ \begin{matrix} {{\sigma_{T}{~~~}{three}\quad {satellite}\quad {solution}}} \\ {{\infty \quad f{our}\quad {or}\quad {more}\quad {satellite}\quad {solutio}\quad n}} \end{matrix} \right.} \end{matrix}$

[0379] where E^(1/2)=diag(UERE) is a diagonal matrix representing the average user effective ranging error and σ_(T)=0.020 represents the uncertainty in the coarse estimate of clock error obtained from the constraint that the range delay is aproximatly 60 milliseconds. (This is dominated by SA if it is on.) The above process is repeated until the estimates are not changing rapidly, i.e. |By|≦test. At convergence, the error covariance factor using the algorithm of equation (67) is selected as P^(1/2). This is used to form the measurement noise factor for the combining step described previously.

[0380] The Delta guidance system will place TIMED at a position and velocity specified in the Conventional Terrestrial System (CTS). ${w_{cts}(t)} = \begin{bmatrix} {r_{cts}^{nom}(t)} \\ {v_{cts}^{nom}(t)} \end{bmatrix}_{6 \times 1}$

[0381] represents the true position and earth-relative velocity of the TIMED CM in the CTS system and w_(cts) ^(nom)(t) represents its nominal value. Then the orbital insertion error appearing in the Delta specification will be of the form: $\begin{matrix} {{\delta \quad w_{cts}^{ins}} = {{w_{cts}\left( \tau_{ins} \right)} - {w_{cts}^{nom}\left( t_{ins}^{nom} \right)}}} & (103) \end{matrix}$

[0382] where τ_(ins) is the true orbital insertion time, defined to be the time immediately after all thrusting (including pyrotechnic separation devices) is over, and t_(ins) ^(nom) is its nominal value. By specifying the insertion error in this way, there is no penalty for placing TIMED in the correct position and velocity at a different time than intended. The desired orbital insertion vector W_(cts) ^(nom)(t_(ins) ^(nom)) is a point fixed in the Conventional Terrestrial System (CTS). If the launch time slips, this aim-point will remain constant, implying that the right ascension of the ascending node of the TIMED orbit will rotate at Earth rate. The six-vector w_(cts) ^(nom)(t_(ins) ^(nom)) will be loaded into memory on the spacecraft prior to launch. The actual orbital insertion time (τ_(ins)), which may be substantially different than the nominal time (t_(ins) ^(nom)), is communicated to the TIMED GNS via a measurement of the TIMED disconnect switch time (t_(dsw)). The difference T_(bias) ^(dsw)≡t_(dsw)−τ_(ins) is the error in time tagging the insertion event and is assumed to be small (at most a few seconds). The TIMED Guidance and Navigation System (GNS) position and velocity state vector is defined in the Conventional Inertial System (CIS). Therefore w_(cst) ^(nom)(t_(ins) ^(nom)) must be transformed into the CIS using a transformation valid at t_(dsw):

w _(cis) ^(gns)(t _(dsw))=A(t _(dsw))·w _(cts) ^(nom)(t _(ins) ^(nom))  (104)

[0383] where: ${A(t)} = {{\begin{bmatrix} {T_{cts}^{cis}(t)} & 0 \\ 0 & {T_{cts}^{cis}(t)} \end{bmatrix}\begin{bmatrix} I & 0 \\ \left\{ {\omega_{e}x} \right\} & I \end{bmatrix}}.}$

[0384] The transformation from Earth-relative to inertial velocity is built-in to A(t). The synchronous error of the TIMED position and velocity state at t_(dsw) is then: $\begin{matrix} {{\delta \quad {w_{cis}^{gns}\left( t_{dsw} \right)}} \equiv {{w_{cis}\left( {\tau^{gns}\left( t_{dsw} \right)} \right)} - {w_{cis}^{gns}\left( t_{dsw} \right)}}} \\ {{\cong {{w_{cis}\left( \tau_{ins} \right)} + {{{\overset{.}{w}}_{cis}\left( \tau_{ins} \right)} \cdot \left( {{\tau^{gns}\left( t_{dsw} \right)} - \tau_{ins}} \right)} - {{A\left( t_{dsw} \right)} \cdot {w_{cts}^{nom}\left( t_{ins}^{nom} \right)}}}}} \\ {{= {{w_{cis}\left( \tau_{ins} \right)} + {{{\overset{.}{w}}_{cis}\left( \tau_{ins} \right)} \cdot \left( {{\tau^{gns}\left( t_{dsw} \right)} - t_{dsw} + t_{dsw} - \tau_{ins}} \right)} -}}} \\ {{\left\lbrack {{A\left( t_{dsw} \right)} + {{\overset{.}{A}\left( t_{dsw} \right)} \cdot \left( {t_{dsw} - \tau_{ins}} \right)}} \right\rbrack \cdot {w_{cts}^{nom}\left( t_{ins}^{nom} \right)}}} \\ {{= {{w_{cis}\left( \tau_{ins} \right)} - {{A\left( \tau_{ins} \right)}{w_{cts}^{nom}\left( t_{ins}^{nom} \right)}} + {{w_{cis}\left( \tau_{ins} \right)} \cdot \left( {T_{bias}^{dsw} - {T\left( t_{dsw} \right)}} \right)}}}} \\ {{~~~~~~~}{{- {A\left( \tau_{ins} \right)}} \cdot {w_{cts}^{nom}\left( t_{ins}^{nom} \right)} \cdot T_{bias}^{dsw}}} \end{matrix}$

[0385] where: $\begin{matrix} {{\overset{.}{A}(t)} = {\begin{bmatrix} {{T_{cts}^{cis}(t)}\left\{ {\omega_{e}x} \right\}} & 0 \\ 0 & {{T_{cts}^{cis}(t)}\left\{ {\omega_{e}x} \right\}} \end{bmatrix}\begin{bmatrix} I & 0 \\ \left\{ {\omega_{e}x} \right\} & I \end{bmatrix}}} \\ {{T\left( t_{dsw} \right)} \equiv {t_{dsw} - {\tau^{gns}\left( t_{dsw} \right)}}} \\ {T_{bias}^{dsw} \equiv {t_{dsw} - \tau_{ins}}} \end{matrix}$

[0386] δw_(cis) ^(gns) has to be written in terms of the orbital insertion error defined in equation (103), since w_(cis)(τ_(ins))=A(τ_(ins))·w_(cts)(τ_(ins)): $\begin{matrix} {{\delta \quad {w_{cis}^{gns}\left( t_{dsw} \right)}} = {{{A\left( \tau_{ins} \right)} \cdot {w_{cts}\left( \tau_{ins} \right)}} - {{A\left( \tau_{ins} \right)}{w_{cts}^{nom}\left( t_{ins}^{nom} \right)}}}} \\ {{~~~~~~~}{{{+ {{\overset{.}{w}}_{cis}\left( \tau_{ins} \right)}} \cdot \left( {T_{bias}^{dsw} - {T\left( t_{dsw} \right)}} \right)} - {{\overset{.}{A}\left( \tau_{ins} \right)}{{w_{cts}^{nom}\left( t_{ins}^{nom} \right)} \cdot T_{bias}^{dsw}}}}} \\ {{= {{{{A\left( \tau_{ins} \right)} \cdot \delta}\quad w_{cts}^{ins}} + {{{\overset{.}{w}}_{cis}\left( \tau_{ins} \right)} \cdot \left( {T_{bias}^{dsw} - {T\left( t_{dsw} \right)}} \right)} -}}} \\ {{{\overset{.}{A}\left( \tau_{ins} \right)}_{\quad} \cdot {w_{cts}^{nom}\left( t_{ins}^{nom} \right)} \cdot T_{bias}^{dsw}}} \\ {{= {{{{A\left( \tau_{ins} \right)} \cdot \delta}\quad w_{cts}^{ins}} - {{{\overset{.}{w}}_{cis}\left( \tau_{ins} \right)} \cdot {T\left( t_{dsw} \right)}}}}} \\ {{~~~~~~~}{{+ \left\lbrack {{{\overset{.}{w}}_{cis}\left( \tau_{ins} \right)} - {{\overset{.}{A}\left( \tau_{ins} \right)}{w_{cts}^{nom}\left( t_{ins}^{nom} \right)}}} \right\rbrack} \cdot T_{bias}^{dsw}}} \end{matrix}$

[0387] where {dot over (w)}_(cis)(t_(dsw))=f(w_(cis))(t_(dsw)) is the model predicted rate of change of inertial position and velocity (largely driven by local gravity). Arranged in matrix form to clearly show the error source contributors as: $\begin{matrix} {\begin{bmatrix} {\delta_{s}{w_{cis}^{gns}\left( t_{dsw} \right)}} \\ {T\left( t_{dsw} \right)} \end{bmatrix} = {\begin{bmatrix} {A\left( \tau_{ins} \right)} & {- {\overset{.}{w}\left( \tau_{ins} \right)}} & {{\overset{.}{w}\left( \tau_{ins} \right)} - {{\overset{.}{A}\left( \tau_{ins} \right)} \cdot {w_{cts}^{nom}\left( t_{ins}^{nom} \right)}}} \\ 0 & 1 & 0 \end{bmatrix}\begin{bmatrix} {\delta \quad w_{cts}^{ins}} \\ {T\left( t_{dsw} \right)} \\ T_{bias}^{dsw} \end{bmatrix}}} \\ {{\cong {\underset{\underset{M}{}}{\begin{bmatrix} {A\left( t_{dsw} \right)} & {- {\overset{.}{w}\left( t_{dsw} \right)}} & {{\overset{.}{w}\left( t_{dsw} \right)} - {{\overset{.}{A}\left( t_{dsw} \right)} \cdot {w_{cts}^{nom}\left( t_{ins}^{nom} \right)}}} \\ 0 & 1 & 0 \end{bmatrix}}\begin{bmatrix} {\delta \quad w_{cts}^{ins}} \\ {T\left( t_{dsw} \right)} \\ T_{bias}^{dsw} \end{bmatrix}}}} \end{matrix}$

[0388] The following approximations have been used $\begin{matrix} {{A\left( t_{dsw} \right)} \cong {{A\left( \tau_{ins} \right)} + {{\overset{.}{A}\left( \tau_{ins} \right)}\left( {t_{dsw} - \tau_{ins}} \right)}}} \\ {= {{A\left( \tau_{ins} \right)} + {{\overset{.}{A}\left( \tau_{ins} \right)}T_{bias}^{dsw}}}} \end{matrix}$

[0389] to substitute the computable A_((t) _(dsw) ₎, {dot over (w)}_((t) _(dsw) ₎ and {dot over (A)}_((t) _(dsw) ₎ for the corresponding quantities evaluated at (the unknown) τ_(ins), realizing that terms like T_(bias) ^(dsw){dot over (A)}(τ_(ins))δw_(cts) ^(ins) are higher order. The covariance structure for the synchronous errors consistent with the initialization in equation (104) is then: $\begin{matrix} {{\begin{bmatrix} {{cov}\left( {\delta_{s}w_{cis}^{gns}} \right)} & {{cov}\left( {{\delta_{s}w_{cis}^{gns}},T} \right)} \\ ({symmetric}) & {{cov}(T)} \end{bmatrix}_{t_{dsw}} = {{M\begin{bmatrix} {{cov}\left( {\delta_{s}w_{cis}^{ins}} \right)} & 0 & 0 \\ 0 & {{cov}(T)} & {{cov}\left( {T,T_{bias}^{dsw}} \right)} \\ 0 & ({symmetric}) & {{cov}\left( T_{bias}^{dsw} \right)} \end{bmatrix}}_{t_{dsw}}M_{t}}}} & (105) \end{matrix}$

[0390] The actual correlation between the errors in the disconnect switch time tagging of the insertion time and the receiver clock error (cov(T,T_(bias) ^(dsw))) depends on whether and how recently the C&DH clock has been synchronized with the GNS 1 pps. It is assumed to be zero. In addition to the initial setting of the position and velocity state vector, the system can reset the state vector by command based on NORAD radar tracking. This command consist of CIS position and velocity estimates along with a defined time of validity (τ_(upld)).

[0391] The first step in implementing this upload is to transform the orbital elements provided by NORAD on its two-line element set format into the CIS position and velocity:

w _(cis) ^(norad)(τ_(upld))=ξ(θ,τ_(upld))

δw _(cis) ^(norad)(τ_(upld))=Ξ·δθ

[0392] where $\begin{matrix} \begin{matrix} {{w_{cis}^{norad}\left( \tau_{upld} \right)} = {\xi \left( {\theta,\tau_{upld}} \right)}} \\ {{{\delta w}_{cis}^{norad}\left( \tau_{upld} \right)} = {{\Xi \cdot \delta}\quad \theta}} \\ {{{where}\quad \Xi} = \frac{\partial{\xi \left( {\theta,\tau_{upld}} \right)}}{\partial\theta}} \\ {{{cov}\left( {\delta w}_{cis}^{norad} \right)} = {\Xi \cdot {{cov}\left( {\delta_{p}\theta} \right)} \cdot \Xi^{t}}} \end{matrix} & (106) \end{matrix}$

 cov(δw _(cis) ^(norad))=Ξ·cov(δ_(ρ)θ)·Ξ^(t)

[0393] where θ are the orbit-defining quantities in the two-line element set, and ξ(θ,τ_(upld)) is the nonlinear transformation implemented in SPG4 that takes these quantities into the inertial position and velocity at time τ_(upld). The derivative of the transformation Ξ can be found analytically or by the numerical differentiation of SGP4. The error δw_(cis) ^(norad)(τ_(upld)) is not identified as synchronous or asynchronous because there is no error associated with τ_(upld) since it is a defined time at which the SGP4 transformation is evaluated. The error (if any) associated with time-tagging the NORAD epoch will propagate through the transformation ξ(•). In this case, the synchronous and asynchronous errors are equal, so a generic designator is used.

[0394] Since the Kalman filter time update propagates between receiver times, the time of validity must be transformed from a true time to a GNS receiver time, using the process illustrated below:

{circumflex over (t)} _(upld) ^(gns)←τ⁻¹(•)←τ_(upld)

[0395] where τ⁻¹(•) is the inverse of the function that takes GNS reference times into their corresponding true times. Specifically, the GNS time corresponding to τ_(upld) is calculated from the relation: $\frac{t_{k} - {\hat{t}}_{upld}^{gns}}{\tau_{k} - \tau_{upld}} \cong {1 + {\hat{ɛ}}_{k}}$

[0396] where:

[0397] t_(k)=current receiver time (know)

[0398] τ_(k)=true time corresponding to t_(k)

[0399] τ_(upld)=time of validity of uploaded state acording to NORAD

[0400] {circumflex over (t)}_(upld) ^(gns)=receiver clock reading corresponding to τ_(upld)

[0401] {circumflex over (ε)}_(k)=current estimate of receiver frequency bias

[0402] which is solved for {circumflex over (t)}_(upld) ^(gns) to obtain: $\begin{matrix} \begin{matrix} {{\hat{t}}_{upld}^{gns} \cong {t_{k} - {\left( {\tau_{k} - \tau_{upld}} \right)\left( {1 + {\hat{ɛ}}_{k}} \right)}}} \\ {\cong {t_{k} - {\left( {\tau_{k} - {\hat{T}}_{k} - \tau_{upld}} \right)\left( {1 + {\hat{ɛ}}_{k}} \right)}}} \end{matrix} & (107) \end{matrix}$

[0403] The foregoing completely defines the TIMED state upload. The position and velocity are given by:

w _(cis) ^(gns)({circumflex over (t)} _(upld) ^(gns))=w _(cis) ^(norad)(τ_(uplds))

[0404] and the start time for the time update (t_(last)) is set to {circumflex over (t)}_(upld) ^(gns) from equation (107).

[0405] The covariance matrix implied by this initialization process is derived s follows. The synchronous error of the GNS state is: $\begin{matrix} {{\delta_{s}{w(t)}} \equiv {{w_{cis}\left( {\tau (t)} \right)} - {w_{cis}^{gns}(t)}}} \\ {{\delta_{s}{w\left( {\hat{t}}_{upld}^{gns} \right)}} = {{w_{cis}\left( {\tau \left( {\hat{t}}_{upld}^{gns} \right)} \right)} - {w_{cis}^{gns}\left( {\hat{t}}_{upld}^{gns} \right)}}} \\ {= {{w_{cis}\left( \tau_{upld} \right)} - {w_{cis}^{norad}\left( \tau_{upld} \right)}}} \\ {= {\delta_{s}{w_{cis}^{norad}\left( \tau_{upld} \right)}}} \\ {= {\delta \quad {w_{cis}^{norad}\left( \tau_{upld} \right)}}} \end{matrix}$

[0406] indicating that the GNS inherits the synchronous error of the NORAD uplinked state vector, which is the generic error defined in equation (106). The appropriate transformation of the error state is then: $\begin{bmatrix} {\delta_{s}{w\left( {\hat{t}}_{upld}^{gns} \right)}} \\ T \end{bmatrix} = {\begin{bmatrix} I & 0 \\ 0 & 1 \end{bmatrix}\begin{bmatrix} {{\delta \quad w_{cis}^{norad}}\quad} \\ T \end{bmatrix}}$

[0407] The appropriate transformation of covariance is: $\begin{bmatrix} {{cov}\left( {\delta_{s}w} \right)} & {{cov}\left( {{\delta_{s}w},T} \right)} \\ ({symmetric}) & {{cov}(T)} \end{bmatrix}_{t_{upld}^{gns}} = \begin{bmatrix} {{cov}\left( {\delta \quad w_{cis}^{norad}} \right)} & 0 \\ ({symmetric}) & {{cov}(T)} \end{bmatrix}$

[0408] The foregoing defines only the GNS position, velocity, and clock error covariance. Default values are used for the rest of the state space.

[0409] Short Term Propagator

[0410] The short term propagator creates the navigation data that is placed on the TIMED data bus every second. This short term data includes (in the order of calculation):

[0411] Data Validity Flags (5),

[0412] CIS frame Position and Velocity,

[0413] Time,

[0414] Sun Vector,

[0415] Geodetic Latitude, Longitude, Altitude,

[0416] East, North, Up Velocity,

[0417] Day/Night Event Notification Flag,

[0418] South Atlantic Anomaly (SAA) Event Notification Flag,

[0419] Polar Region Event Notification Flag,

[0420] Ground Station Event Notification Flags (GSENF)

[0421] The methodology used to create these data is described by the following derivations wherein reference is made to the dynamic propagation rutine, a primary part of the Kalman Filter (KF) that performs the time update for the KK Crank. This routine is capable of operating in both covariance propagation and non-covariance propagation modes.

[0422] During the short term propagation, the dynamic propagation routine operates in the noncovariance propagation mode.

[0423] These data are computed after the time update in each KF Crank interval. This is part of the “Cleanup” of the KF Crank interval. During each KF Crank, the short term data is computed for a 180 second interval beginning at the start time of the next KF Crank. Thus, the basic flow of the KF Crank for a single crank interval is:

[0424] KF Crank Start at T_(i)

[0425] Command Input

[0426] Measurement Update,

[0427] Time Update (TU) (state propagated to T_(i+180))

[0428] Short Term Propagate (for T_(i+180) to T_(i+360))

[0429] In the following description, the short term data is valid for the period T_(i+180) to T_(i+360). The short term data cannot be created for the same interval as the KF Crank because the KF Crank takes longer than 1 second to complete. Therefore, the short term data for the for the first several seconds of the current interval is not available when it is needed.

[0430] The short term propagator begins with the propagated dynamic state vector X⁻ (position(3), velocity(3), drag, clock, frequency), state vector derivative {dot over (X)}⁻, and covariance factor matrix L⁻. These variables are created by the time update part of the KF Crank and are valid at time T_(i+180). To simplify the notation, the superscript “⁻” denoting “before measurement” is dropped. Assuming T_(so)=T_(i+180), the required calculations are:

[0431] Compute Data Validity Flags

[0432] Propagate State to T_(i+180) and T_(i+360)

[0433] Compute Polynomial Fit Coefficients

[0434] First 180 Second Loop: at every second

[0435] Compute X(t)

[0436] Compute T_(cis) ^(cts)(t)

[0437] Compute Sun Vector

[0438] Compute OTS Frame Position, Velocity, and Sun Vector

[0439] Take Ω×R out of velocity in X_(cts)

[0440] Compute Geodetic Latitude, Longitude, and Altitude

[0441] Compute East, North, Up Velocity

[0442] Compute Day/Night Event Notification Flag

[0443] Compute South Atlantic Anomaly Event Notification Flag

[0444] Compute Polar Region Event Notification Flag

[0445] Compute Ground Station Event Notification Flag (GSENF)

[0446] Second 180 Second Loop: at every second

[0447] Compute X(t)

[0448] Compute T_(cis) ^(cts)(t)

[0449] Compute GSENF

[0450] Shift GSENFs

[0451] The data validity flags are computed using the L matrix. They are constant throughout the 180 second interval. The following values are used to compute the one sigma values:

[0452] The covariance matrix P=L·L^(T) and that L is lower triangular. This means that the diagonal values of P are given by ${P\left( {i,i} \right)} = {\sum\limits_{j = i}^{i}\quad {{L\left( {i,j} \right)}^{2}.}}$

[0453] This yields the one sigma values for position, velocity and time. The data validity flags are then set from these one sigma values according to the following:

[0454] if all three σ_(position) values are <the position validity value, the position and event validity flags are set to VALID,

[0455] if all three σ_(velocity) values are <the velocity validity value, the velocity valid velocity flag is set to VALID,

[0456] if the σclock value is <the time validity value, the time and sun vector validity flags are set to VALID.

[0457] The same dynamic propagator that is used in the Time Update of the KF Crank is used to propagate the state to T_(i+180) and T_(i+360).. (See equation (34) and the derivations leading thereto.) This gives state vectors and state derivative vectors at S0, S0+180(S1), and S0+360(S2). At. this point the system has the following information: X(S0), {dot over (X)}(S0), X (S1), {dot over (X)}(S1), X(S2), {dot over (X)}(S2)

[0458] The system requires short term data at a 1-Hertz rate, therefor the data is interpolated between S0, S1, and S2. This is accomplished by fitting a 5th order polynomial to the curve described by:

[0459] X(S0), {dot over (X)}(S0), X(S1), {dot over (X)}(S1), X(S2), {dot over (X)}(S2).

[0460] This structure is used to interpolate data for the state vector and the state vector derivative defined as follows:

[0461] For the state vector:

X(t)=A+B·t+C·t ² +D·t ³ +E·t ⁴ +F·t ⁵  (108)

[0462] For the state vector derivative:

{dot over (X)}(t)=B+2·C·t+3·D·t ²+4·E·t ³+5·F·t ⁴  (109)

[0463] The interval between S0 and S1 is the same as the interval between S1 and S2 and denoted by I. By letting the time(t) for the above equations go from −180 to +180 instead of 0 to 360, the system can then use the following six equations to determine the six coefficients:

X(t=−I)=A−B·I+C·I ² −D·I ³ +E·I ⁴ −F·I ⁵

{dot over (X)}(t=−I)=B−2·C·I+3·D·I ²−4·E·I ³+5·F·I ⁴

X(t=0)=A

{dot over (X)}(t=0)=B

X(t=I)=A+B·I+C·I ² +D·I ³ +E·I ⁴ +F·I ⁵

{dot over (X)}(t=I)=B+2·C·I+3·D·I ²+4·E·I ³+5·F·I ⁴

[0464] This yields the following equations for the six coefficients:

A=X(S 1)

B={dot over (X)}(S 1)

C=(1/I ²)·(X(S 2)−2·X(S 1)+X(S 0)−I·{dot over (X)}(S 2)/4+I·{dot over (X)}(S 0)/4)

D=(1/(4·I ³))·(5·X(S 2)−5·X(S 0)−8·I·{dot over (X)}(S 1)−I·{dot over (X)}(S 2)+I·{dot over (X)}( S 0))

E=−(1/2·I ⁴)·(X(S 2)−2·X(S 1)+X(S 0)−I·{dot over (X)}(S 2)/2+I·{dot over (X)}(S 0)/2)

F=(1.0/(4·I ⁵))·(3·X(S 2)−3·X(S 0)−4·I·{dot over (X)}(S 1)−I·{dot over (X)}(S 2)+I·{dot over (X)}(S 0))

[0465] The foregoing provides the coefficients required to compute X(t) at any point by looping through the first 180 second interval and proceeding as follows at each of the 180 (t_(S0+1) to t_(S0+180)) points.

[0466] Using the previously described points, equation (108), X(t)=A+B·t+C·t²+D·t³+E·t⁴+F·t⁵, X(t) is computed each time (t) goes from −180 to 180 while the trajectory time goes from S0 to S0+180.

[0467] The same routine is used to compute T_(cis) ^(cts) that is used in the Dynamic Propagation Routine (see also equations (71) and (72) and the comments therefor).

[0468] The sun vector, S_(cis), in conventional inertial system, CIS, coordinates is computed using the same routine that is used in the Dynamic Propagation Routine.

[0469] With T_(cis) ^(cts) and S_(cis) computed, the system determines position, velocity and sun vector in the conventional terrestrial system, CTS, frame:

[0470] The position vector in the CTS frame is determined by:

P _(cts) =T _(cis) ^(cts) ·X _(cis)(position)  (110)

[0471] The velocity vector in the CTS frame is determined by transforming the coordinate system from CIS to CTS and removing the earths relative velocity from the inertial velocity. The velocity vector in the CTS frame is:

V _(cts) =T _(cis) ^(cts) ·X _(cis)(velocity)−Ω_(earth,cts) ×P _(cts)  (111)

[0472] The matrix multiplication is eliminated because: ${\Omega_{{earth},{cts}} \times P_{cts}} = {\begin{bmatrix} 0 & {- \omega_{earth}} & 0 \\ \omega_{earth} & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}.\begin{bmatrix} P_{1} \\ P_{2} \\ P_{3} \end{bmatrix}}$

[0473] which simplifies the process and results in:

(Ω_(earth,cts) ×P _(cts))(1)=−ω_(earth) ·P _(cts)(2)

(Ω_(earth,cts) P _(cts))(2)=ω_(earth) ·P _(cts)(1)

(Ω_(earth,cts) P _(cts))(3)=0

[0474] The sun vector in the CTS frame is:

S_(cts) =T _(cis) ^(cts) ·S _(cis)  (112)

[0475] The Geodetic Latitude (lat) and Altitude are computed using a routine that is the same as used in the Dynamic Propagation Routine. The Longitude (ion) is computed using the standard C library routine atan2:

longitude=α tan 2(P _(cis)(y_axis), P _(cts)(x_axis)  (113)

[0476] To compute the east, north, and up velocity, the system computes the transformation from CTS coordinates to East, Down, and North @ Equator (EDN) coordinates: $T_{cts}^{edn} = \begin{bmatrix} {\cos \left( {{lon} + {\pi/2}} \right)} & {\sin \left( {{lon} + {\pi/2}} \right)} & 0 \\ {- {\sin \left( {{lon} + {\pi/2}} \right)}} & {\cos \left( {{lon} + {\pi/2}} \right)} & 0 \\ 0 & 0 & 1 \end{bmatrix}$

[0477] It then computes the transformation from EDN to East, North, Up (ENU) coordinates: $\begin{matrix} \begin{matrix} {T_{edn}^{enu} = \begin{bmatrix} 1 & 0 & 0 \\ 0 & {\cos \left( {{\pi/2} - {lat}} \right)} & {\sin \left( {{\pi/2} - {lat}} \right)} \\ 0 & {- {\sin \left( {{\pi/2} - {lat}} \right)}} & {\cos \left( {{\pi/2} - {lat}} \right)} \end{bmatrix}} \\ {T_{cts}^{enu} = {T_{edn}^{enu} \cdot T_{cts}^{edn}}} \\ {V_{enu} = {T_{edn}^{enu} \cdot V_{cts}}} \end{matrix} & (114) \end{matrix}$

[0478] The system uses the Geodetic Latitude, therefor “UP” is in the local vertical direction.

[0479] Because the normal to the surface in the ENU coordinate frame is given by the vector [0,0,1], the system transforms the vector to the CTS frame using: $U_{cts} = {T_{enu}^{cts} \cdot \begin{bmatrix} 0 \\ 0 \\ 1 \end{bmatrix}}$

[0480] which provides:

U _(cts)(1)=T _(enu) ^(cts)(1,3)=T _(cts) ^(enu)(3,1)

U _(cts)(2)=T _(enu) ^(cts)(2,3)=T _(cts) ^(enu)(3,2)

U _(cts)(1)=T _(enu) ^(cts)(3,3)=T _(cts) ^(enu)(3,3)  (115)

[0481] This provides a vector normal to the surface of the earth in the CTS coordinate frame. The system then creates: D=U_(cts)•S_(cts). If U_(cts)•S_(cts)≧0.0, then the latitude and longitude point is in sunlight and the flag=1. When U_(cts)•S_(cts)<0.0, the flag=0.

[0482] The South Atlantic Anomaly, SAA is described in the GNS by 12 longitude and latitude points which are vertices, in clockwise order (looking down at the earth), of a convex polygon inside which lies the SAA. When these values are loaded into the KF database, the system computes vectors for each side using S_(i)=V_(i+1)−V_(i), where V_(i)=(longitude_(i), latitude_(i)). These are longitude and latitude points (NOT latitude, an longitude) and are ready for use in the Short Term Propagation loop.

[0483] To determine if the spacecraft is within the SAA polygon, the system performs the following operations for each side of the SAA after setting the SAA event notification flag to ‘EVENT’.

[0484] The spacecraft vector, S_(SC,i), is computed using the previously computed spacecraft latitude and longitude (Lon_(SC), Lat_(SC)), which is in the form of the vector from V_(i) to the spacecraft location:

S _(SC,i)=(Lon_(SC),Lat_(SC))−V_(i)  (116)

[0485] A z-coordinate (=0) is appended to each vector and used to successively compute the cross-product of a side of the SAA polygon with the spacecraft vector: $\begin{matrix} {Q = {{S_{i} \times S_{{SC},i}} = {\begin{bmatrix} 0 \\ 0 \\ Q_{z} \end{bmatrix} = {\begin{bmatrix} 0 & 0 & S_{iy} \\ 0 & 0 & {- S_{ix}} \\ {- S_{iy}} & S_{ix} & 0 \end{bmatrix}\begin{bmatrix} S_{{SC},{ix}} \\ S_{{SC},{iy}} \\ 0 \end{bmatrix}}}}} & (117) \end{matrix}$

[0486] The system uses the right hand rule, i.e., if Q_(z)>0 the spacecraft lies outside the SAA and the SAA Event Notification flag is set to ‘NO-EVENT’. The system then exits the loop.

[0487] The Compute Polar Region Event Notification flag is set using a simple comparison, i.e., if |Latitude|≧Value, the flag is set to 1.

[0488] The location of each ground station is described by a latitude and longitude. When these values are loaded into the KF Database, the system computes CTS coordinates V_(GSi,cts) for each of the ground stations using the ground station latitude and longitude and an altitude 0. It then computes the CTS vector N_(GSi,cts) normal to the surface of the earth at the ground station coordinates using the following steps:

[0489] Multiplying the two matrices of equation (114) reduces the operation to: $\begin{matrix} {\theta = {\frac{\pi}{2} - {lat}}} \\ {\varphi = {{lon} + \frac{\pi}{2}}} \\ {T_{cts}^{enu} = \begin{bmatrix} {\cos (\varphi)} & {\sin (\varphi)} & 0 \\ {{- {\cos (\theta)}}{\sin (\varphi)}} & {{\cos (\theta)}{\cos (\varphi)}} & {\sin (\theta)} \\ {{\sin (\theta)}{\sin (\varphi)}} & {{- {\sin (\theta)}}{\cos (\varphi)}} & {\cos (\theta)} \end{bmatrix}} \end{matrix}$

[0490] The normal to the surface in the ENU coordinate frame is given by the vector [0,0,1 ] as established by equation (115). The vector is transformed to the CTS frame $N_{{GSi},{cts}} = {T_{enu}^{cts} \cdot {\begin{bmatrix} 0 \\ 0 \\ 1 \end{bmatrix}.}}$

[0491] This yields:

N _(GSi,cts)(1)=T _(enu) ^(cts)(1,3)=T _(cts) ^(enu)(3,1)=sin(θ)sin(φ)

N _(GSi,cts)(2)=T _(enu) ^(cts)(2,3)=T _(cts) ^(enu)(3,2)=−sin(θ)cos(φ)

N _(GSi,cts)(3)=T _(enu) ^(cts)(3,3)=T _(cts) ^(enu)(3,3)=cos(φ)  (118)

[0492] The values are now ready for use in the Short Term Propagation loop. To determine if the spacecraft is above the horizon relative to each ground station, the system computes the dot product of the vector from the ground station to the spacecraft and the ground station normal vector: D=(P_(cts)−V_(GSi,cts))•N_(GSi,cts) If D≧0, the spacecraft is at or above the horizon and the GSENF is 1.

[0493] The system computes the second 180 second loop using the previously described operations, i.e.:

[0494] X(t) is computed each time (t) goes from −180 to180 while the trajectory time goes from S0 to S0+180.

X(t)=A+B·t+C·t ² +D·t ³ +E·t ⁴ +F·t ⁵

[0495] The same routine is used to compute T_(cis) ^(cts) that is used in the first 180 second loop.

[0496] The same routine, equation (118), that is used in the first 180 second loop is used to compute the GSENF.

[0497] The system then shifts the GSENF as the short term propagation continues to provide GSENFs for each ground station for a period of 360 seconds. The extra 180 seconds allows the system to predict rise or set times up to 180 seconds in advance of the time it outputs the data. The GSENFs which are output may need to be set before the spacecraft rises above the horizon and may need to be unset before the spacecraft has set below the horizon to satisfy Rise/Set Lead Time requirements. The system predicts rise time so that instruments on board the satellite can be ready to send data when the satellite rises above the horizon instead of spending time gaining acquisition to the ground station. The system also computes set lead time so that the satellite may know when to start shutting down the data transmission sequence. The time shifts for the Rise Lead Time R_(lt) and Set Lead Time S_(lt) are GNS parameters.

[0498] For example, if R_(lt)=4 seconds and the GSENFs are

[0499] 0 0 0 0 0 0 1 1 1 1 1 . . . 1 1 1

[0500] the time shifted GSENFs are

[0501] 0 0 01 1 1 1 1 1 1 1 . . . 1 1 1

[0502] Or if R_(lt)=5 and the GSENFs are

[0503] 1 1 1 1 . . . 1 1 1 1 1 1 1 1 0 0

[0504] the time shifted GSENFs are

[0505] 1 1 1 1 . . . 1 1 1 0 0 0 0 0 0 0

[0506] There are several situations that can occur in the stream of GSENFs during the 360 second interval.

[0507] 1) There are no GSENFs set. These flags do not need to be modified for Rise/Set Lead Times.

[0508] 2) The GSENF stream started unset, changed to set and stayed set for the remainder of the interval. These flags need to be modified as in the first example above.

[0509] 3) The GSENF stream started set, changed to unset aud stayed unset for the remainder of the interval. These flags need to be modified as in the second example above.

[0510] 4) The GSENF stream started unset, changed to set, and changed back to unset. These flags need to be modified, first, as in the first example, and next, as in the second example 2. The system performs the modifications in that order to cover the situation in which the GSENFs are set for a period of time≦S_(lt)−R_(lt).

[0511] The foregoing is considered as illustrative only of the principles of the invention. Since numerous modifications and changes will readily occur to those skilled in the art, it is not desired to limit the invention to the exact construction and applications shown and described. Accordingly, all suitable modifications and equivalents may be resorted to and are considered to fall within the scope of the invention and the appended claims and their equivalents. 

What is claimed is:
 1. A method for orbital platform navigation, including the steps of: sensing the data transmitted by a plurality of global positioning system satellites; determining from said sensed transmitted data through the application of a software implemented Kalman filter, data defining current time and position and velocity of said orbital platform; and initiating and controlling the operation of systems on-board said orbital platform based on said data defining current time and position and velocity.
 2. A method for orbital platform navigation as defined by claim 1, wherein said Kalman filter utilizes previously determined data defining time and position and velocity when performing said step of determining from said sensed transmitted data, current time and position and velocity.
 3. A method for orbital platform navigation as defined by claim 2, wherein said step of determining current time and position and velocity includes steps executed by said Kalman filter of calculating a square-root covariance form.
 4. A method for orbital platform navigation as defined by claim 3, wherein said Kalman filter performs the steps of determining the measurement of slant range from said orbital platform to each of said global positioning system satellites providing data used in determining said data defining current time and position and velocity.
 5. A method for orbital platform navigation as defined by claim 4, wherein said plurality of global positioning system satellites comprise at least three satellites.
 6. A method for determining orbital platform navigation as defined by claim 5, wherein said Kalman filter performs the steps of providing a plurality of state space determinations arranged in first and second partitions; said first partition including states which directly determined the orbital platform position, velocity, drag parameter error, receiver clock and frequency bias; and said second partition includes states not directly affecting position and time.
 7. A method for orbital platform navigation as defined by claim 6, wherein said steps of providing a plurality of state space determinations include the steps of: calculating a position state space; calculating a velocity state space; calculating a drag parameter error state space; calculating a clock error state space; calculating a frequency error state space; calculating a selective availability and Markov process state space; and calculating an integrated carrier phase bias state space.
 8. A method for orbital platform navigation as defined by claim 6, wherein said steps of providing a plurality of state space determinations include the steps of: calculating three position state spaces; calculating three velocity state spaces; calculating a drag parameter error state space; calculating a clock error state space; calculating a frequency error state space; calculating 24 selected availability and Markov process state spaces; and calculating 12 integrated carrier phase bias state spaces.
 9. A method for orbital platform navigation as defined by claim 6, wherein said steps of providing a plurality of state space determinations include the steps of: calculating a plurality of dynamic states including, a position state space, a velocity state space, a drag parameter error state space, a clock error state space, and a frequency error state space; and dynamically coupling said dynamic states to each other.
 10. A method for orbital platform navigation as defined by claim 3, wherein said Kalman filter performs said step of updating said data defining current time by executing steps propagating the state and covariance between measurements.
 11. A method for orbital platform navigation as defined by claim 9, wherein said step of propagating the state uses time as an independent variable.
 12. A method for orbital platform navigation as defined by claim 3, wherein said steps of determining current time and position and velocity include update steps executed by said Kalman filter comprised of propagating state and covariance from the present to the next anticipated measurement for the dynamic states of position, velocity, drag, and clock, each of which is expressed as a function {dot over (x)}_(dyn)=f(x_(dyn),t) where t equals time, according to the nonlinear function $F_{dyn} \equiv \frac{\partial f_{dyn}}{\partial x_{dyn}}$

where the covariance is F.
 13. A method for orbital platform navigation as defined by claim 12, wherein the deterministic part of said covariance factor F used in performing said update steps is defined by ${\overset{\sim}{P}}_{k + {1/k}}^{t/2} = {P_{k/k}^{t/2} \cdot \left( {\Phi \left( {t_{k + 1},t_{k}} \right)} \right)^{t}}$

, where ${\overset{\sim}{P}}_{k + {1/k}}^{t/2}$

is the state error covariance after a deterministic update and prior to a stochastic update.
 14. A method for orbital platform navigation as defined by claim 13, including the Kalman filter executed steps of propagating state and covariance from the present to the next anticipated measurement for the states and biases which obey linear dynamics according to the function Φ_(pdr)(t _(k+1) ,t _(k))=S1(t _(k+1) ,t _(k)).
 15. A method for orbital platform navigation as defined by claim 14, wherein said states and biases which obey linear dynamics include availability states for said global positioning system satellites and phase biases. 